Electronic Proceedings in Theoretical Computer Science (Aug 2011)

A new proof for the decidability of D0L ultimate periodicity

  • Vesa Halava,
  • Tero Harju,
  • Tomi Kärki

DOI
https://doi.org/10.4204/EPTCS.63.20
Journal volume & issue
Vol. 63, no. Proc. WORDS 2011
pp. 147 – 151

Abstract

Read online

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.