On time reduction and simulation in cellular spaces

DOI10.1080/00207169908804822MaRDI QIDQ4261194zbMATH OpenOpenAlexFDO

Authors Thomas Buchholz, Martin Kutrib, Andreas 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/

zbMATH Keywords

cellular spaces

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A note on symmetrical cellular spaces
• scientific article; zbMATH DE number 4026832
• Reversible space-time simulation of cellular automata
• On the reduction of computational complexity of cellular automata

Cites work

• A characterization of constant-time cellular automata computation
• A note on cellular automata simulations
• Cellular automata complexity trade-offs
• Computation and construction universality of reversible cellular automata
• Fast parallel language recognition by cellular automata
• On 'forgetful' cellular automata
• On real-time cellular automata and trellis automata
• On Some Open Problems in the Theory of Cellular Automata
• One-way bounded cellular automata
• Parallel language recognition in constant time by cellular automata
• Pushdown cellular automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Real-time language recognition by one-dimensional cellular automata
• Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
• Simple Computation-Universal Cellular Spaces
• Simulations between cellular automata on Cayley graphs
• Some comments on neighborhood size for tessellation automata
• Structural and behavioral equivalences of tessellation automata
• Tessellation Automata

This page was built for publication: On time reduction and simulation in cellular spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4261194)