A new proof for the decidability of D0L ultimate periodicity

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.

Saved in:
Bibliographic Details
Published in:Electronic proceedings in theoretical computer science 2011-08, Vol.63 (Proc. WORDS 2011), p.147-151
Main Authors: Halava, Vesa, Harju, Tero, Kärki, Tomi
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.63.20