UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA

DOI10.1142/S0129054111008891zbMath1252.68165MaRDI QIDQ2909096

Andreas Malcher, Martin Kutrib, Henning Bordihn

Publication date: 29 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

formal languagesdecidability questionscooperating systemsautomata systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Cellular Automata: Descriptional Complexity and Decidability ⋮ Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities ⋮ Reversible parallel communicating finite automata systems

Cites Work

• Unnamed Item
• Multiprocessor automata
• Some undecidable problems for parallel communicating finite automata systems
• On two-way multihead automata
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• On Communicating Finite-State Machines
• k + 1 Heads Are Better than k
• Returning and non-returning parallel communicating finite automata are equivalent
• On Multi-Head Finite Automata
• Multi-tape and multi-head pushdown automata

This page was built for publication: UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA