Returning and non-returning parallel communicating finite automata are equivalent (Q5441543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multiprocessor automata / 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: 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: Q4714446 / rank
 
Normal rank

Revision as of 16:01, 27 June 2024

scientific article; zbMATH DE number 5235504
Language Label Description Also known as
English
Returning and non-returning parallel communicating finite automata are equivalent
scientific article; zbMATH DE number 5235504

    Statements

    Identifiers