#8227: Improving iterated palindromic closure computation
---------------------------+------------------------------------------------
Reporter: abmasse | Owner: AlexGhitza
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3.3
Component: algebra | Keywords: iterated palindromic closure
Author: abmasse | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
---------------------------+------------------------------------------------
There is a faster way to compute the iterated paindromic closure of a word
than using the definition. The problem with the latter is that it needs to
compute the longest f-palindromic suffix of the current word at each step,
while it is possible to easily deduce this length only by looking at the
directive word.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8227>
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.
