A First Investigation of Sturmian Trees

DOI10.1007/978-3-540-70918-3_7zbMath1186.68343OpenAlexW2118239114MaRDI QIDQ3590924

Olivier Carton, Isabelle Fagnot, Jean Berstel, Luc Boasson

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_7

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (5)

A split-based incremental deterministic automata minimization algorithm ⋮ Sturmian and Episturmian Words ⋮ Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Subword complexity and Sturmian colorings of regular trees

This page was built for publication: A First Investigation of Sturmian Trees