research

A new proof for the decidability of D0L ultimate periodicity

Authors
Publication date
1 January 2011
Publisher
'Open Publishing Association'
Doi
    View on arXiv

    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.Comment: In Proceedings WORDS 2011, arXiv:1108.341

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Crossref

      redirect
      oaiinfo:doi/10.4204%2Feptcs.63.20
      Last time updated on 27/02/2019

      Directory of Open Access Journals

      redirect
      oaioai:doaj.org/article:46f602498...
      Last time updated on 18/12/2014

      CiteSeerX

      redirect
      oaioai:CiteSeerX.psu:10.1.1.1052....
      Last time updated on 07/12/2020