A new proof for the decidability of D0L ultimate periodicity
Vesa Halava (Department of Mathematics, University of Turku), Tero, Harju (Department of Mathematics, University of Turku), Tomi K\"arki, (Department of Mathematics, 2Department of Teacher Education, University, of Turku)
TL;DR
This paper presents a novel proof demonstrating that it is decidable whether a D0L system produces ultimately periodic sequences, utilizing the decidability of p-periodicity in morphic words and adapting existing methods.
Contribution
The paper introduces a new proof technique for the decidability of D0L ultimate periodicity, building on the approach of Harju and Linna.
Findings
Decidability of D0L ultimate periodicity established.
New proof method based on p-periodicity of morphic words.
Adaptation of existing approaches to prove decidability.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Natural Language Processing Techniques