#12225: Finite and lazy factorial languages
-----------------------------+----------------------------------------------
Reporter: vdelecroix | Owner: vdelecroix
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.8
Component: combinatorics | Keywords: word, factorial language,
symbolic dynamics
Work_issues: | Upstream: N/A
Reviewer: | Author: Vincent Delecroix
Merged: | Dependencies: #12224
-----------------------------+----------------------------------------------
Changes (by vdelecroix):
* owner: Vincent Delecroix => vdelecroix
* dependencies: => #12224
Old description:
> 1) Implement a data structure (similar to a tree with label on edges) for
> finite factorial language which extends the actual SuffixTrie and
> SuffixTree in sage/combinat/words/suffix_tree.py (a "RauzyCastle").
>
> 2.a) Use it in a static version for the implementation of finite
> factorial language
>
> 2.b) Use it in a dynamical version for the implementation of some lazy
> languages (square free, cube free, overlap free, finite defect, ...)
>
> dependencies: #12224
New description:
1) Implement a data structure (similar to a tree with label on edges) for
finite factorial language which extends the actual SuffixTrie and
SuffixTree in sage/combinat/words/suffix_tree.py (a "RauzyCastle").
2.a) Use it in a static version for the implementation of finite factorial
language
2.b) Use it in a dynamical version for the implementation of some lazy
languages (square free, cube free, overlap free, finite defect, ...)
see also: #12224, #12227
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12225#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
