In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
Two-dimensional cellular automata (CA) systems are widely used for modeling spatio-temporal dynamics of evolving populations. Conversely, the logistic equation is a 1-D model descr...