scientific article; zbMATH DE number 1490952

zbMATH Open0957.68056MaRDI QIDQ4496487FDOQ4496487

Authors: Carlos Martín-Vide, Victor Mitrana 

Publication date: 9 November 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

parallel communicating automata system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (12)

• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• On the Computational Capacity of Parallel Communicating Finite Automata
• On the computational capacity of parallel communicating finite automata
• Undecidability and hierarchy results for parallel communicating finite automata
• Returning and non-returning parallel communicating finite automata are equivalent
• Asynchronous systems of parallel communicating finite automata
• Some undecidable problems for parallel communicating finite automata systems
• Automata on Multisets of Communicating Objects
• PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS
• Variants of distributed P automata and the efficient parallelizability of languages
• Logic for communicating automata with parameterized topology
• Systems of parallel communicating restarting automata

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)