Self-verifying Cellular Automata
From MaRDI portal
Publication:6108530
Recommendations
Cites work
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- scientific article; zbMATH DE number 2068878 (Why is no real title available?)
- scientific article; zbMATH DE number 1886323 (Why is no real title available?)
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Encyclopedia of Complexity and Systems Science
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Non-deterministic cellular automata and languages
- Nondeterministic Communication with a Limited Number of Advice Bits
- On real-time cellular automata and trellis automata
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- On time computability of functions in one-way cellular automata
- One-way bounded cellular automata
- One-way stack automata
- Optimal simulation of self-verifying automata by deterministic automata
- Real-time computations with restricted nondeterminism
- Real-time language recognition by one-dimensional cellular automata
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
Cited in
(3)
This page was built for publication: Self-verifying Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108530)