General algorithm for two-dimensional totalistic cellular automata

DOI10.1016/0021-9991(92)90051-YzbMath0785.68066WikidataQ61763218 ScholiaQ61763218MaRDI QIDQ1201089

Franco Bagnoli, Raúl Rechtman, Stefano Ruffo

Publication date: 17 January 1993

Published in: Journal of Computational Physics (Search for Journal in Brave)

zbMATH Keywords

fast simulations of cellular automatamulti-site coding techniquetotalistic cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles ⋮ A new calculation for Boolean derivative using Cheng product ⋮ Interaction-Based Computing in Physics ⋮ Dynamical regimes in non-ergodic random Boolean networks

Cites Work

• Two-dimensional cellular automata
• Invariant in cellular automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: General algorithm for two-dimensional totalistic cellular automata