Related papers: Cellular automata with majority rule on evolving n…
The notion of ontological states is introduced here with reference to the Cellular Automaton Interpretation of Quantum Mechanics proposed by G.'t Hooft. A class of discrete deterministic "Hamiltonian" Cellular Automata is defined that has…
We propose a four-way classification of two-dimensional semi-totalistic cellular automata that is different than Wolfram's, based on two questions with yes-or-no answers: do there exist patterns that eventually escape any finite bounding…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
We study phase transitions in a long-range one-dimensional cellular automaton with two symmetric absorbing states. It includes and extends several other models, like the Ising and Domany-Kinzel ones. It is characterized by a competing…
The probabilistic cellular automaton (PCA) method is highlighted for its relatively simple numerical algorithm and low computational cost in the simulation of microstructural evolution. In this method, probabilistic state change rules are…
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to…
We use cellular automata model to study the cooperation between cyclists. In the two-lane model, cyclists can change lanes. Even there is someone on the back they will take a cooperative attitude. It means that they will be in a same…
Autocatalytic reaction system with a small number of molecules is studied numerically by stochastic particle simulations. A novel state due to fluctuation and discreteness in molecular numbers is found, characterized as extinction of…
Understanding employee behavior in a workplace is critical for enhancing overall organizational performance. Despite numerous efforts to improve work environments, many organizations still need help with challenges primarily rooted in…
Invertible cellular automata are useful as models of physical systems with microscopically revesible dyanmics. There are several well-understood ways to construct them: partitioning rules, second-order rules, and alternating-grid rules. We…
Cellular automaton (CA) approach is an important theoretical framework for studying complex system behavior and has been widely applied in various research field. CA traffic flow models have the advantage of flexible evolution rules and…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…
A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…
For many networks, the connection pattern (often called the topology) can vary in time, depending on the changing state, or mode, of the modules within the network. For example, "airplane mode" is the name for one communicative mode of a…
We propose a novel density based numerical method for uncertainty propagation under certain partial differential equation dynamics. The main idea is to translate them into objects that we call cellular probabilistic automata and to evolve…
We consider the problem of metastability for stochastic reversible dynamics with exponentially small transition probabilities. We generalize previous results in several directions. We give an estimate of the spectral gap of the transition…
We study discretisation effects in cellular automata models for pedestrian dynamics by reducing the cell size. Then a particle occupies more than one cell which leads to subtle effects in the dynamics, e.g. non-local conflict situations.…