A new proof for the decidability of D0L ultimate periodicity
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna.
cs.FL↗