Some undecidable problems for parallel communicating finite automata systems (Q1603408)

From MaRDI portal
Revision as of 09:09, 10 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Some undecidable problems for parallel communicating finite automata systems
scientific article

    Statements

    Some undecidable problems for parallel communicating finite automata systems (English)
    0 references
    14 July 2002
    0 references
    formal languages
    0 references
    parallel communicating finite automata systems
    0 references
    equivalence problem
    0 references
    universe problem
    0 references
    emptiness problem
    0 references

    Identifiers