Iterative arrays with self-verifying communication cell
From MaRDI portal
Recommendations
Cites work
- Cellular automata -- a computational point of view
- Complexity of one-way cellular automata
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- scientific article; zbMATH DE number 1886323 (Why is no real title available?)
- Iterative arrays with self-verifying communication cell
- Iterative tree automata
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Nondeterministic Communication with a Limited Number of Advice Bits
- On One-Way Cellular Arrays
- On strongly context-free languages
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- One-way bounded cellular automata
- Optimal simulation of self-verifying automata by deterministic automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time computations with restricted nondeterminism
- Real-time language recognition by one-dimensional cellular automata
- Self-verifying cellular automata
- Self-verifying pushdown and queue automata
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Signals in one-dimensional cellular automata
- State complexity of some operations on binary regular languages
This page was built for publication: Iterative arrays with self-verifying communication cell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195133)
