Iterative arrays with self-verifying communication cell
From MaRDI portal
Publication:2278569
DOI10.1007/978-3-030-20981-0_6zbMath1425.68283OpenAlexW2951194123MaRDI QIDQ2278569
Publication date: 5 December 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-20981-0_6
Related Items (1)
Cites Work
- Optimal simulation of self-verifying automata by deterministic automata
- Iterative tree automata
- Signals in one-dimensional cellular automata
- Real-time language recognition by one-dimensional cellular automata
- One-way bounded cellular automata
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Self-Verifying Pushdown and Queue Automata
- Complexity of One-Way Cellular Automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Encyclopedia of Complexity and Systems Science
- Self-verifying Cellular Automata
- Unnamed Item
This page was built for publication: Iterative arrays with self-verifying communication cell
