A new proof for the decidability of D0L ultimate periodicity
arXiv:1108.3631 · doi:10.4204/EPTCS.63.20
Abstract
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.
arXiv commentIn Proceedings WORDS 2011, arXiv:1108.3412