Some undecidable problems for parallel communicating finite automata systems (Q1603408): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multiprocessor automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack cooperation in multistack pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146255 / rank
 
Normal rank

Revision as of 10:47, 4 June 2024

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
    0 references
    0 references

    Identifiers