Decidability of the HD0L ultimate periodicity problem

2011/11/14 by Fabien Durand, Durand, Fabien
Computer Science · Mathematics · #Algorithms and Data Compression #Cellular Automata and Applications #cs.FL #math.CO #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1111.3268

arxiv created 2013/01/02 · arxiv updated 2013/01/03

Abstract

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

Related

• A proof for the decidability of HD0L ultimate periodicity
• 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