| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 3, July-September 2007
|
|
|---|---|---|
| Page(s) | 285 - 306 | |
| DOI | https://doi.org/10.1051/ita:2007020 | |
| Published online | 25 September 2007 | |
A graph approach to computing nondeterminacy in substitutional dynamical systems
1
University of Copenhagen, Universitetsparken
5, 2100 Copenhagen Ø, Denmark; toke@math.ku.dk
2
School of Mathematical & Physical Sciences, Mathemathics Building - V123, University of Newcastle, University Drive, Callaghan NSW 2308, Australia.
3
University of Copenhagen, Universitetsparken
5, 2100 Copenhagen Ø, Denmark; eilers@math.ku.dk
Received:
5
July
2004
Accepted:
1
August
2006
We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word in the shift space associated to that substitution, and determines when such representations are equivalent under orbit and shift tail equivalence. The algorithm has been implemented and applied in the study of certain new invariants for flow equivalence of substitutional dynamical systems.
Mathematics Subject Classification: 37B10 / 68R15
Key words: Sustitution / shift spaces / special elements / orbit equivalence / shift tail equivalence
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.