On time reduction and simulation in cellular spaces
From MaRDI portal
Publication:4261194
DOI10.1080/00207169908804822zbMath0945.68136OpenAlexW1986940146MaRDI QIDQ4261194
Martin Kutrib, Thomas Buchholz, Andreas G. Klein
Publication date: 1 September 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: http://geb.uni-giessen.de/geb/volltexte/1998/15/
Cites Work
- On real-time cellular automata and trellis automata
- Fast parallel language recognition by cellular automata
- Parallel language recognition in constant time by cellular automata
- On 'forgetful' cellular automata
- Computation and construction universality of reversible cellular automata
- Pushdown cellular automata
- Simulations between cellular automata on Cayley graphs
- Real-time language recognition by one-dimensional cellular automata
- A characterization of constant-time cellular automata computation
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- One-way bounded cellular automata
- A note on cellular automata simulations
- On Some Open Problems in the Theory of Cellular Automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Tessellation Automata
- Simple Computation-Universal Cellular Spaces
- Cellular automata complexity trade-offs
- Structural and behavioral equivalences of tessellation automata
- Some comments on neighborhood size for tessellation automata
This page was built for publication: On time reduction and simulation in cellular spaces
