Decidability of the HD0L ultimate periodicity problem
From MaRDI portal
Publication:4928769
DOI10.1051/ita/2013035zbMath1361.68112arXiv1111.3268OpenAlexW2963494353MaRDI QIDQ4928769
Publication date: 18 June 2013
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3268
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items (13)
Asymptotic properties of free monoid morphisms ⋮ Automatic sequences of rank two ⋮ On almost periodicity of morphic sequences ⋮ Effective S-adic Symbolic Dynamical Systems ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Decidability and universality of quasiminimal subshifts ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Decidable problems in substitution shifts ⋮ Unnamed Item ⋮ Relations on words ⋮ Periodic points in random substitution subshifts ⋮ Periodicity of morphic words ⋮ Minimal automaton for multiplying and translating the Thue-Morse set
This page was built for publication: Decidability of the HD0L ultimate periodicity problem
