An Algorithm Enumerating All Infinite Repetitions in a D0L System
Abstract
We describe a simple algorithm which, for a given D0L system, returns all factors v such that vk is in the language of the system for all k. This algorithm can be used to decide whether a D0L system is repetitive.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.