Language complexity of rotations and Sturmian sequences

DOI10.1016/S0304-3975(97)00105-9zbMath0912.68109OpenAlexW1985777178MaRDI QIDQ1274922

Petr Kůrka, François Blanchard

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00105-9

zbMATH Keywords

irrational rotationsSturmian sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Infinite traces and symbolic dynamics ⋮ Topologically completely positive entropy and zero-dimensional topologically completely positive entropy ⋮ Column representation of Sturmian words in cellular automata ⋮ Realtime subshifts ⋮ Coding rotations on intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Simple continued fractions for some irrational numbers
• Zero-dimensional dynamical systems, formal languages, and universality
• \(\beta\)-expansions and symbolic dynamics
• Languages, equicontinuity and attractors in cellular automata
• An Introduction to Symbolic Dynamics and Coding
• Quasi-realtime languages
• Similarity of automorphisms of the torus

This page was built for publication: Language complexity of rotations and Sturmian sequences