Repetitiveness of HD0L-systems
semanticscholar（2021）
Abstract
Let H be an HD0L-system. We show that the number of primitive words v such v for any k is an element of the factorial language of H is bounded. In particular, this result applies to the set of all factors of a morphic word.
MoreTranslated text
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