A new proof for the decidability of D0L ultimate periodicity
Formal Languages and Automata Theory
2011-08-19 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1108.3631,
title = {A new proof for the decidability of D0L ultimate periodicity},
author = {Vesa Halava and Tero Harju and Tomi Kärki},
journal= {arXiv preprint arXiv:1108.3631},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412