Sturmian trees
From MaRDI portal
Publication:968266
DOI10.1007/s00224-009-9228-0zbMath1209.68394MaRDI 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
68R15: Combinatorics on words
Related Items
Subword complexity and Sturmian colorings of regular trees, Automatic sequences: from rational bases to trees, Standard Sturmian words and automata minimization algorithms, Tree shift topological entropy, On extremal cases of Hopcroft's algorithm, Minimisation of automata, Hopcroft's algorithm and tree-like automata, A Challenging Family of Automata for Classical Minimization Algorithms, On Extremal Cases of Hopcroft’s Algorithm
Cites Work