Sturmian trees

DOI10.1007/S00224-009-9228-0MaRDI QIDQ968266zbMATH OpenOpenAlexFDO

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

Publication date 5 May 2010

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-009-9228-0

zbMATH Keywords

Sturmian wordlabeled treeMoore algorithmminimal automaton

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• A First Investigation of Sturmian Trees
• Infinite labeled trees: from rational to Sturmian trees
• Sturmian words, Lyndon words and trees
• Sturmian words and the Stern sequence
• scientific article; zbMATH DE number 6730060

Cites work

• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Fundamental properties of infinite trees
• Représentation géométrique de suites de complexité $2n+1$
• Sequences with minimal block growth
• Special factors and uniqueness conditions in rational trees
• Substitutions in dynamics, arithmetics and combinatorics

Cited in

(14)

• Automatic sequences: from rational bases to trees
• On Extremal Cases of Hopcroft’s Algorithm
• Standard Sturmian words and automata minimization algorithms
• Tree shift topological entropy
• McKay trees
• A challenging family of automata for classical minimization algorithms
• Minimisation of automata
• Hopcroft's algorithm and tree-like automata
• Subword complexity and Sturmian colorings of regular trees
• Sturmian Canons
• On extremal cases of Hopcroft's algorithm
• Smirnov trees
• Infinite labeled trees: from rational to Sturmian trees
• A First Investigation of Sturmian Trees

This page was built for publication: Sturmian trees

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