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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1051/ita:2007014 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1051/ITA:2007014 / rank
 
Normal rank

Latest revision as of 17:00, 30 December 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