Self-verifying Cellular Automata
From MaRDI portal
Publication:6108530
DOI10.1007/978-3-319-99813-8_31zbMATH Open1515.68193OpenAlexW2888015909MaRDI QIDQ6108530FDOQ6108530
Authors: Martin Kutrib, Thomas Worsch 
Publication date: 30 June 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: http://geb.uni-giessen.de/geb/volltexte/2018/13522/
Recommendations
Cites Work
- Title not available (Why is that?)
- Non-deterministic cellular automata and languages
- Encyclopedia of Complexity and Systems Science
- On time computability of functions in one-way cellular automata
- One-way bounded cellular automata
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
- Real-time computations with restricted nondeterminism
- Title not available (Why is that?)
- Optimal simulation of self-verifying automata by deterministic automata
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- One-way stack automata
- Nondeterministic Communication with a Limited Number of Advice Bits
- Real-time language recognition by one-dimensional cellular automata
- On real-time cellular automata and trellis automata
- Title not available (Why is that?)
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
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)
