Regularity of sets of initial strings of periodic D0L-systems
From MaRDI portal
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.
Recommendations
Cites work
- Decidability of periodicity for infinite words
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3940748 (Why is no real title available?)
- scientific article; zbMATH DE number 3767067 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On the periodicity of morphisms on free monoids
- Periodic D0L languages
Cited in
(5)
This page was built for publication: Regularity of sets of initial strings of periodic D0L-systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580989)