Regularity of sets of initial strings of periodic D0L-systems (Q580989): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90086-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991943033 / rank | |||
Normal rank | |||
Revision as of 00:23, 20 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
