Decidability of the HD0L ultimate periodicity problem

DOI10.1051/ITA/2013035MaRDI QIDQ4928769zbMATH OpenOpenAlexFDO

Authors Fabien Durand

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

zbMATH Keywords

decidabilityHD0Lperiodicityreturn words

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Abstract: In this paper we prove the decidability of the HD0L ultimate periodicity problem.

Cited in

(17)

• Periodic points in random substitution subshifts
• Minimal automaton for multiplying and translating the Thue-Morse set
• Decidability and universality of quasiminimal subshifts
• Periodicity of morphic words
• On almost periodicity of morphic sequences
• Asymptotic properties of free monoid morphisms
• Effective S-adic symbolic dynamical systems
• scientific article; zbMATH DE number 7453075 (Why is no real title available?)
• Automatic sequences of rank two
• Relations on words
• Ultimate periodicity problem for linear numeration systems
• Bracket words: A generalisation of Sturmian words arising from generalised polynomials
• Decidable problems in substitution shifts
• Alekseĭ Yakovlevich Kanel'-Belov
• Automatic abelian complexities of Parikh-collinear fixed points
• Morphic sequences: complexity and decidability
• \(\mathcal{S}\)-adic characterization of minimal dendric shifts

This page was built for publication: Decidability of the HD0L ultimate periodicity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928769)