On Lazy Representations and Sturmian Graphs
From MaRDI portal
Publication:3073629
DOI10.1007/978-3-642-18098-9_14zbMath1247.11013OpenAlexW1599511149MaRDI QIDQ3073629
Filippo Mignosi, A. Gabriele, Chiara Epifanio, Jeffrey O. Shallit, Christiane Frougny
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_14
Applications of graph theory (05C90) Combinatorics on words (68R15) Structural characterization of families of graphs (05C75) Other number representations (11A67)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Sturmian graphs
- Real numbers with bounded partial quotients: A survey
- Numeration systems, linear recurrences, and regular sets
- Some combinatorial properties of Sturmian words
- Digital straightness -- a review
- \(\beta\)-shift, numeration systems, and automata
- Sturmian and Episturmian Words
- Automatic Sequences
- Number representation and finite automata
- On the numeration system of Ostrowski
This page was built for publication: On Lazy Representations and Sturmian Graphs