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

From MaRDI portal
Revision as of 19:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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