The ω sequence problem for DOL systems is decidable (Q3769989)

From MaRDI portal
Revision as of 23:44, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The ω sequence problem for DOL systems is decidable
scientific article

    Statements

    The ω sequence problem for DOL systems is decidable (English)
    0 references
    0 references
    0 references
    1984
    0 references
    parallel rewriting systems
    0 references
    infinite words
    0 references
    homomorphisms
    0 references
    decidability
    0 references
    limit language equivalence
    0 references
    \(\omega \)-equivalence
    0 references
    D0L systems
    0 references

    Identifiers