#12228: Eventually Periodic word class
-----------------------------+----------------------------------------------
Reporter: sstarosta | Owner: sage-combinat
Type: PLEASE CHANGE | Status: new
Priority: minor | Milestone: sage-4.8
Component: combinatorics | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Implement a class for eventually periodic words.
The motivation is the following behavior.
{{{
sage: W = Words([0,1])
sage: w1 = W(lambda x: 1 if x%2 else 0)
sage: w1[0] == w1[2]
True
sage: w1[0] is w1[2]
False
}}}
While using periodic word class we can have
{{{
sage: w2 = W.periodic_word(period=[0,1])
sage: w2[0] == w2[2]
True
sage: w2[0] is w2[2]
True
}}}
It will be used in substitutive language #12227
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12228>
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.
