Sturmian trees
From MaRDI portal
Publication:968266
DOI10.1007/S00224-009-9228-0zbMATH Open1209.68394OpenAlexW2913981637MaRDI QIDQ968266FDOQ968266
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Représentation géométrique de suites de complexité $2n+1$
- Substitutions in dynamics, arithmetics and combinatorics
- Fundamental properties of infinite trees
- Sequences with minimal block growth
- Title not available (Why is that?)
- Special factors and uniqueness conditions in rational trees
Cited In (14)
- A First Investigation of Sturmian Trees
- Sturmian Canons
- Automatic sequences: from rational bases to trees
- McKay trees
- Minimisation of automata
- Subword complexity and Sturmian colorings of regular trees
- Infinite labeled trees: from rational to Sturmian trees
- On extremal cases of Hopcroft's algorithm
- Tree shift topological entropy
- A challenging family of automata for classical minimization algorithms
- Standard Sturmian words and automata minimization algorithms
- Smirnov trees
- On Extremal Cases of Hopcroft’s Algorithm
- Hopcroft's algorithm and tree-like automata
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)
