A new proof for the decidability of D0L ultimate periodicity

Vesa Halava
(Department of Mathematics, University of Turku)
Tero Harju
(Department of Mathematics, University of Turku)
Tomi Kärki
(Department of Mathematics and 2Department of Teacher Education, University of Turku)

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.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 147–151.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.20 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org