Pages that link to "Item:Q2909096"
From MaRDI portal
The following pages link to Undecidability and hierarchy results for parallel communicating finite automata (Q2909096):
Displaying 8 items.
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- On the decidability of correctness problems for a communicating automata net (Q2735908) (← links)
- Returning parallel communicating finite automata with communication bounds: hierarchies, decidabilities, and undecidabilities (Q2800414) (← links)
- On the computational capacity of parallel communicating finite automata (Q2909225) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)