A new proof for the decidability of D0L ultimate periodicity
Vesa Halava, Tero Harju, Tomi Kärki
Electronic Proceedings in Theoretical Computer Science · 2011
doi:10.4204/eptcs.63.20 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.