On the Computational Capacity of Parallel Communicating Finite Automata

DOI10.1007/978-3-540-85780-8_11zbMath1161.68513OpenAlexW1505714320MaRDI QIDQ3533006

Martin Kutrib, Andreas Malcher, Henning Bordihn

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Complexity of multi-head finite automata: origins and directions

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor automata
• A note on semilinear sets and bounded-reversal multihead pushdown automata
• On two-way multihead automata
• PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
• The Boolean Closure of Growing Context-Sensitive Languages
• On Communicating Finite-State Machines
• Church-Rosser Thue systems and formal languages
• 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: On the Computational Capacity of Parallel Communicating Finite Automata