Sturmian trees
From MaRDI portal
Publication:968266
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
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
This page was built for publication: Sturmian trees