Pages that link to "Item:Q2909225"
From MaRDI portal
The following pages link to On the computational capacity of parallel communicating finite automata (Q2909225):
Displaying 12 items.
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities (Q2800414) (← links)
- Systems of parallel communicating restarting automata (Q2877370) (← links)
- Undecidability and hierarchy results for parallel communicating finite automata (Q2909096) (← links)
- Asynchronous Parallel Communicating Systems of Pushdown Automata (Q2949728) (← links)
- PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- On Parallel Implementations of Deterministic Finite Automata (Q3637342) (← links)
- (Q4513850) (← links)
- (Q4550982) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)