1 research outputs found
A new proof for the decidability of D0L ultimate periodicity
Full text linkWe 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.Comment: In Proceedings WORDS 2011, arXiv:1108.341
