Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton

DOI10.1007/978-3-031-33180-0_8arXiv2303.11133OpenAlexW4381304098MaRDI QIDQ6134866

Benjamin Hellouin de Menibus, Pierre Béaur

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.11133

zbMATH Keywords

Sturmian wordsdecidabilitysubstitutions\( \omega \)-automata

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Sturmian words
• The monadic theory of morphic infinite words and generalizations
• On sets of indefinitely desubstitutable words
• Decidability and universality of quasiminimal subshifts
• Asymptotic enumeration of Minimal Automata
• Initial powers of Sturmian sequences
• Représentation géométrique de suites de complexité $2n+1$
• An Introduction to Symbolic Dynamics and Coding
• Rank and symbolic complexity
• -adic characterization of minimal ternary dendric shifts

This page was built for publication: Sturmian and Infinitely Desubstitutable Words Accepted by an $$\omega $$-Automaton