Regularity of sets of initial strings of periodic D0L-systems (Q580989): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 00:42, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularity of sets of initial strings of periodic D0L-systems |
scientific article |
Statements
Regularity of sets of initial strings of periodic D0L-systems (English)
0 references
1986
0 references
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.
0 references
regular language
0 references
periodic D0L-systems
0 references
