scientific article; zbMATH DE number 1490952

MaRDI QIDQ4496487zbMATH OpenFDO

Authors Carlos Martín-Vide, Victor Mitrana

Publication date 9 November 2000

zbMATH Keywords

parallel communicating automata system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• scientific article; zbMATH DE number 1502112
• Measuring communication in parallel communicating finite automata
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• On the computational capacity of parallel communicating finite automata

Cited in

(15)

• Parallelization of automata
• Some undecidable problems for parallel communicating finite automata systems
• Communicating automata
• Asynchronous systems of parallel communicating finite automata
• Systems of parallel communicating restarting automata
• Variants of distributed P automata and the efficient parallelizability of languages
• Undecidability and hierarchy results for parallel communicating finite automata
• On the computational capacity of parallel communicating finite automata
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• On the Computational Capacity of Parallel Communicating Finite Automata
• Automata on Multisets of Communicating Objects
• scientific article; zbMATH DE number 1502112 (Why is no real title available?)
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• Logic for communicating automata with parameterized topology
• Returning and non-returning parallel communicating finite automata are equivalent

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4496487)