On lazy representations and Sturmian graphs
DOI10.1007/978-3-642-18098-9_14zbMATH Open1247.11013OpenAlexW1599511149MaRDI QIDQ3073629FDOQ3073629
Authors: C. Epifanio, A. Gabriele, Filippo Mignosi, Christiane Frougny, Jeffrey Shallit
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
Recommendations
Applications of graph theory (05C90) Structural characterization of families of graphs (05C75) Combinatorics on words (68R15) Other number representations (11A67)
Cites Work
- Title not available (Why is that?)
- Digital straightness -- a review
- Automatic Sequences
- Title not available (Why is that?)
- Sturmian and Episturmian Words
- Some combinatorial properties of Sturmian words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real numbers with bounded partial quotients: A survey
- Numeration systems, linear recurrences, and regular sets
- \(\beta\)-shift, numeration systems, and automata
- Number representation and finite automata
- On the numeration system of Ostrowski
- On Sturmian graphs
Cited In (1)
This page was built for publication: On lazy representations and Sturmian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073629)