An Algorithm Enumerating All Infinite Repetitions in a D0L System.
Journal of Discrete Algorithms（2015）
Abstract
We describe a simple algorithm that finds all primitive words v such that vk is a factor of the language of a given D0L-system for all k. It follows that the number of such words is finite. This polynomial-time algorithm can be also used to decide whether a D0L-system is repetitive.
MoreTranslated text
Key words
D0L-system,Periodicity,Repetition
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined