Pages that link to "Item:Q3021983"
From MaRDI portal
The following pages link to PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES (Q3021983):
Displaying 14 items.
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Tissue P systems. (Q1401274) (← links)
- Some undecidable problems for parallel communicating finite automata systems (Q1603408) (← links)
- Non-regular unary language and parallel communicating Watson-Crick automata systems (Q1680552) (← links)
- Reversible parallel communicating finite automata systems (Q2041681) (← links)
- On the power of parallel communicating Watson-Crick automata systems (Q2503279) (← links)
- Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (Q2800414) (← links)
- UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909096) (← links)
- ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA (Q2909225) (← links)
- Asynchronous Parallel Communicating Systems of Pushdown Automata (Q2949728) (← links)
- Two-Party Watson-Crick Computations (Q3073638) (← links)
- On the Computational Capacity of Parallel Communicating Finite Automata (Q3533006) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)
