Sturmian trees

DOI10.1007/s00224-009-9228-0zbMath1209.68394OpenAlexW2913981637MaRDI QIDQ968266

Luc Boasson, Olivier Carton, Isabelle Fagnot, Jean Berstel

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)

Related Items (9)

Tree shift topological entropy ⋮ Automatic sequences: from rational bases to trees ⋮ On extremal cases of Hopcroft's algorithm ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Hopcroft's algorithm and tree-like automata ⋮ A Challenging Family of Automata for Classical Minimization Algorithms ⋮ On Extremal Cases of Hopcroft’s Algorithm ⋮ Minimisation of automata ⋮ Subword complexity and Sturmian colorings of regular trees

Cites Work

• Unnamed Item
• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• 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

This page was built for publication: Sturmian trees