#12230: WordMorphism - growing letters, injectivity
-----------------------------+----------------------------------------------
Reporter: sstarosta | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.8
Component: combinatorics | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Enhance WordMorphism with the following:
* analysis of growing/non-growing letters (the letter a is growing of
|sigma**n(a)| tends to infinity)
* test of injectivity (on a given substitutive language)
Motivation comes from substitutive languages, see #12227.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12230>
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.
