Non-deterministic cellular automata and languages
From MaRDI portal
Recommendations
Cites work
- Alternation on cellular automata
- Characterizations and computational complexity of systolic trellis automata
- Computations on nondeterministic cellular automata
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- Iterative tree automata
- On One-Way Cellular Arrays
- On real time one-way cellular array
- On real-time cellular automata and trellis automata
- On time computability of functions in one-way cellular automata
- One-way bounded cellular automata
- Quasi-realtime languages
- 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
- Relating the power of cellular arrays to their closure properties
- Relationships between nondeterministic and deterministic tape complexities
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Signals in one-dimensional cellular automata
- Simple Computation-Universal Cellular Spaces
- Some results on time-varying and relativised cellular automata*
- Tessellation Automata
Cited in
(10)- scientific article; zbMATH DE number 1886323 (Why is no real title available?)
- A Language for Particle Interactions in Rule 54 and Other Cellular Automata
- A logical approach to locality in pictures languages
- Self-verifying Cellular Automata
- Cellular devices and unary languages
- Complexity of one-way cellular automata
- Shrinking one-way cellular automata
- Nondeterministic cellular automata
- scientific article; zbMATH DE number 2113944 (Why is no real title available?)
- Languages, equicontinuity and attractors in cellular automata
This page was built for publication: Non-deterministic cellular automata and languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869781)
