scientific article; zbMATH DE number 1502112

MaRDI QIDQ4503153zbMATH OpenFDO

Authors Victor Mitrana

Publication date 4 September 2000

zbMATH Keywords

parallel communicating finite automata system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Measuring communication in parallel communicating finite automata
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• scientific article; zbMATH DE number 1490952
• Measuring communication in automata systems (invited paper)
• On the Computational Capacity of Parallel Communicating Finite Automata

Cited in

(12)

• Some undecidable problems for parallel communicating finite automata systems
• Asynchronous systems of parallel communicating finite automata
• Undecidability and hierarchy results for parallel communicating finite automata
• On the computational capacity of parallel communicating finite automata
• Measuring communication in automata systems (invited paper)
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• Two-party Watson-Crick computations
• On the Computational Capacity of Parallel Communicating Finite Automata
• scientific article; zbMATH DE number 1490952 (Why is no real title available?)
• scientific article; zbMATH DE number 1795910 (Why is no real title available?)
• Measuring communication in parallel communicating finite automata
• Parallel communicating limited and uniformly limited 0L systems

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 Q4503153)