Sturmian words and a criterium by Michaux-Villemaire
From MaRDI portal
Publication:557919
DOI10.1016/j.tcs.2005.01.010zbMath1076.68050OpenAlexW1978078781MaRDI QIDQ557919
Isabel M. Araújo, Véronique Bruyère
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.010
Sturmian sequencescombinatorics on wordsCobham's theoryrepetitions in infinite wordssynthetic sequences
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Frequencies of factors of Sturmian sequences
- Generalized balances in Sturmian words
- Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- Représentation géométrique de suites de complexité $2n+1$
- Automatic Sequences
- On a conjecture of J. Shallit
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy