#8604: Add a class for factor-enumerable words
-----------------------------+----------------------------------------------
Reporter: slabbe | Owner: slabbe
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.4
Component: combinatorics | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Add a class for factor-enumerable words, i.e. having an algorithm that
enumerates the factor of length n which includes finite words and some
family of infinite words. The new file gathers methods (e.g.
``rauzy_graph``) that depends only on the existence of such an algorithm.
It also adds some method about left,right and bi special words:
{{{
sage: f = words.FibonacciWord()[:30]
sage: f.number_of_left_special_factors(7)
8
}}}
The new class ``Word_nfactor_enumerable`` inherits from the abstract
``Word_class`` and {{{FiniteWord_class}}} now inherits from this
``Word_nfactor_enumerable`` class. Later, inifinite words having a such an
algorithm will inherit also from this new class (in some other ticket).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8604>
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.
