Regularity of sets of initial strings of periodic D0L-systems (Q580989)

From MaRDI portal
Revision as of 12:27, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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
    0 references
    regular language
    0 references
    periodic D0L-systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references