#12227: Adic languages
-----------------------------+----------------------------------------------
Reporter: vdelecroix | Owner: Vincent Delecroix
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-4.8
Component: PLEASE CHANGE | Keywords: substitution, adic, symbolic
dynamics
Work_issues: | Upstream: N/A
Reviewer: | Author: Vincent Delecroix
Merged: | Dependencies: #12224
-----------------------------+----------------------------------------------
An adic language is a symbolic counterpart to the renormalization in
dynamics and generalize what are called "substitution fixed point"
(roughly implemented in sage/combinat/words/). Such kind of languages are
described by an infinite sequence of substitutions and many algorithms
exist
* enumeration of words of length n
* enumeration of left/right special factors
* synchronization delays
* ...
Particular cases should be consider apart:
* Sturmian languages
* Interval Exchange Transformations
* Free Group Automorphisms
* ...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12227>
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.
