Regularity of sets of initial strings of periodic D0L-systems
For an alphabet A and a morphism \(h: A^*\to A^*\), the set of words w such that the D0L-system (A,h,w) is periodic is shown to be a noncounting, regular language. Use is made of the authors' recent investigations of periodic D0L-systems.
scientific article; zbMATH DE number 4018403