Two-dimensional cellular automata and their neighborhoods
From MaRDI portal
Publication:1884945
DOI10.1016/j.tcs.2003.08.011zbMath1070.68099OpenAlexW1996470750MaRDI QIDQ1884945
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.011
Related Items (3)
Closure properties of cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Development of the multi-scale analysis model to simulate strain localization occurring during material processing
Cites Work
- A linear speed-up theorem for cellular automata
- Two-dimensional cellular automata recognizer
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- On Some Open Problems in the Theory of Cellular Automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Machine Complexity Versus Interconnection Complexity in Iterative Arrays
- Simple Computation-Universal Cellular Spaces
This page was built for publication: Two-dimensional cellular automata and their neighborhoods