On the Computational Capacity of Parallel Communicating Finite Automata
From MaRDI portal
Publication:3533006
DOI10.1007/978-3-540-85780-8_11zbMATH Open1161.68513OpenAlexW1505714320MaRDI QIDQ3533006FDOQ3533006
Authors: 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
Recommendations
- On the computational capacity of parallel communicating finite automata
- scientific article; zbMATH DE number 1502112
- The parallel complexity of finite-state automata problems
- Undecidability and hierarchy results for parallel communicating finite automata
- Undecidability and hierarchy results for parallel communicating finite automata
- Measuring communication in parallel communicating finite automata
- On Parallel Implementations of Deterministic Finite Automata
- scientific article; zbMATH DE number 1419219
- Some undecidable problems for parallel communicating finite automata systems
- scientific article; zbMATH DE number 1490952
Cites Work
- On Communicating Finite-State Machines
- On Multi-Head Finite Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Church-Rosser Thue systems and formal languages
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- k + 1 Heads Are Better than k
- Multiprocessor automata
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- Returning and non-returning parallel communicating finite automata are equivalent
- On two-way multihead automata
- Multi-tape and multi-head pushdown automata
- The Boolean Closure of Growing Context-Sensitive Languages
Cited In (15)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of multi-head finite automata: origins and directions
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
- On the computational capacity of parallel communicating finite automata
- Undecidability and hierarchy results for parallel communicating finite automata
- Undecidability and hierarchy results for parallel communicating finite automata
- Returning and non-returning parallel communicating finite automata are equivalent
- Reversible parallel communicating finite automata systems
- Some undecidable problems for parallel communicating finite automata systems
- Title not available (Why is that?)
- On Parallel Implementations of Deterministic Finite Automata
- Measuring communication in parallel communicating finite automata
- Systems of parallel communicating restarting automata
This page was built for publication: On the Computational Capacity of Parallel Communicating Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533006)
