A proof for the decidability of HD0L ultimate periodicity

2011/10/21 by Ivan Mitrofanov, Mitrofanov, Ivan
Computer Science · Mathematics · #Algorithms and Data Compression #Cellular Automata and Applications #Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO) #math.CO #math.LO #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1110.4780

33 pages, in Russian

openalex publication_date 2011/10/21 · arxiv created 2012/07/17 · arxiv updated 2012/07/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We give a proof for the decidability of the HD0L ultimate periodicity problem.

Related

• Decidability of the HD0L ultimate periodicity problem
• HD0L-ω-equivalence and periodicity problems in the primitive case (to the memory of G. Rauzy)
• On uniform recurrence of HD0l systems
• Ultimate periodicity of b-recognisable sets : a quasilinear procedure
• A Look at Chowla's Problem