An Algorithm Enumerating All Infinite Repetitions in a D0L System
Karel Klouda, \v{S}t\v{e}p\'an Starosta
TL;DR
This paper presents a straightforward algorithm that identifies all factors in a D0L system that are infinitely repetitive, enabling the determination of the system's overall repetitiveness.
Contribution
The paper introduces a novel, simple algorithm to enumerate all infinitely repetitive factors in a D0L system, aiding in the analysis of its repetitiveness.
Findings
Algorithm successfully enumerates all infinite repetitions in D0L systems.
Enables decision of whether a D0L system is repetitive.
Provides a practical tool for analyzing formal language properties.
Abstract
We describe a simple algorithm which, for a given D0L system, returns all factors such that is in the language of the system for all . This algorithm can be used to decide whether a D0L system is repetitive.
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.