A note on Sturmian words
From MaRDI portal
Publication:418801
DOI10.1016/j.tcs.2011.12.047zbMath1238.68115OpenAlexW2110891049MaRDI QIDQ418801
Antonio Restivo, Dominique Perrin
Publication date: 30 May 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.047
Related Items (6)
Abelian powers and repetitions in Sturmian words ⋮ Abelian Repetitions in Sturmian Words ⋮ Finite section method for aperiodic Schrödinger operators ⋮ Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton ⋮ Sequences of words defined by two-way transducers ⋮ Studies on finite Sturmian words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Burrows-Wheeler transform and Sturmian words
- Characterisations of balanced words via orderings
- Random generation of finite Sturmian words
- Some characterizations of finite Sturmian words.
- A linear algorithm for nonhomogeneous spectra of numbers
- On Christoffel classes
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Some properties of the singular words of the Fibonacci word
This page was built for publication: A note on Sturmian words
