A First Investigation of Sturmian Trees

DOI10.1007/978-3-540-70918-3_7MaRDI QIDQ3590924zbMATH OpenOpenAlexFDO

Authors Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Sturmian trees
• Infinite labeled trees: from rational to Sturmian trees
• scientific article; zbMATH DE number 6730060
• Sturmian words and the Stern sequence
• Subword complexity and Sturmian colorings of regular trees

Cited in

(12)

• Infinite labeled trees: from rational to Sturmian trees
• Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
• Sturmian and Episturmian Words
• A congruence-based perspective on automata minimization algorithms
• Quasi-Sturmian colorings on regular trees
• Continued fraction algorithm for Sturmian colorings of trees
• Subword complexity and Sturmian colorings of regular trees
• Developments in Language Theory
• Substreetutions and more on trees
• On Sturmian graphs
• A split-based incremental deterministic automata minimization algorithm
• Sturmian trees

This page was built for publication: A First Investigation of Sturmian Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590924)