A new proof for the decidability of D0L ultimate periodicity

2Department of Teacher Education; Tero Harju (Department of Mathematics; Tomi K\"arki (Department of Mathematics; University of Turku); Vesa Halava (Department of Mathematics

arxiv: 1108.3631 · v1 · pith:BGOWNEBKnew · submitted 2011-08-18 · 💻 cs.FL · cs.DM

A new proof for the decidability of D0L ultimate periodicity

Vesa Halava (Department of Mathematics , University of Turku) , Tero Harju (Department of Mathematics , Tomi K\"arki (Department of Mathematics , 2Department of Teacher Education This is my paper

classification 💻 cs.FL cs.DM

keywords decidabilityperiodicityproofultimateadaptedapproachgiveharju

0 comments

read the original 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.

This paper has not been read by Pith yet.

A new proof for the decidability of D0L ultimate periodicity

discussion (0)