Achieving Universal Computations on One-Dimensional Cellular Automata
From MaRDI portal
Publication:4931277
DOI10.1007/978-3-642-15979-4_74zbMath1308.68081OpenAlexW1485264169MaRDI QIDQ4931277
Publication date: 4 October 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15979-4_74
Cites Work
- On real-time cellular automata and trellis automata
- Directional dynamics for cellular automata: A sensitivity to initial condition approach
- A six-state minimal time solution to the Firing squad synchronization problem
- Signals in one-dimensional cellular automata
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- STACS 2005
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Achieving Universal Computations on One-Dimensional Cellular Automata