Undecidability and hierarchy results for parallel communicating finite automata
From MaRDI portal
Publication:2909096
DOI10.1142/S0129054111008891zbMATH Open1252.68165MaRDI QIDQ2909096FDOQ2909096
Authors: Martin Kutrib, Andreas Malcher, Henning Bordihn 
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- Undecidability and hierarchy results for parallel communicating finite automata
- Some undecidable problems for parallel communicating finite automata systems
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
- On the computational capacity of parallel communicating finite automata
- On the Computational Capacity of Parallel Communicating Finite Automata
- scientific article; zbMATH DE number 1502112
- Asynchronous systems of parallel communicating finite automata
- The parallel complexity of finite-state automata problems
- scientific article; zbMATH DE number 1490952
- Undecidability results for deterministic communicating sequential processes
Cites Work
- Title not available (Why is that?)
- On Communicating Finite-State Machines
- On Multi-Head Finite 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
- Some undecidable problems for parallel communicating finite automata systems
Cited In (9)
- On the Computational Capacity of Parallel Communicating Finite Automata
- On the decidability of correctness problems for a communicating automata net
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities
- A Rice-style theorem for parallel automata
- On the computational capacity of parallel communicating finite automata
- Undecidability and hierarchy results for parallel communicating finite automata
- Cellular automata: descriptional complexity and decidability
- Reversible parallel communicating finite automata systems
- Some undecidable problems for parallel communicating finite automata systems
This page was built for publication: Undecidability and hierarchy results for parallel communicating finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909096)
