#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
-----------------------------+----------------------------------------------
Comment(by slabbe):
Nice ticket!
Related to this, I want to add that I want to remove the class and the
file `nfactor_enumerable_word` from Sage. Currently, only Finite Word
class inherits from it. So it would be easy to fix by just moving the
methods to the Finite Word class. I am sorry for having introduced this
class into Sage : it was an error. This job must be done inside of the
appropriate Language class... I still haven't created the ticket for it,
but I definitively will.
Sébastien
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12225#comment:2>
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.
