Related papers: Solution of the Density Classification Problem wit…
We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…
We construct a two dimensional Cellular Automata based model for the description of pedestrian dynamics. Wide range of complicated pattern formation phenomena in pedestrian dynamics are described in the model, e.g. lane formation, jams in a…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
We consider the problems of characterizing and testing the stability of cellular automata configurations that evolve on a two-dimensional torus according to threshold rules with respect to the von-Neumann neighborhood. While stable…
In this paper we study the family of two-state Totalistic Freezing Cellular Automata (TFCA) defined over the triangular and square grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state…
We discuss example of an elementary cellular automaton for which the density of ones decays toward its limiting value as a power of the number of iterations $n$. Using the fact that this rule conserves the number of blocks 10 and that…
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…
We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in…
Within the class of stochastic cellular automata models of traffic flows, we look at the velocity dependent randomization variant (VDR-TCA) whose parameters take on a specific set of extreme values. These initial conditions lead us to the…
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
We investigate the percolation properties of a two-state (occupied - empty) cellular automaton, where at each time step a cluster of occupied sites is removed and the same number of randomly chosen empty sites are occupied again. We find a…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
The dynamics of rule 54 one-dimensional two-state cellular automaton (CA) are a discrete analog of a space-time dynamics of excitations in nonlinear active medium with mutual inhibition. A cell switches its state 0 to state 1 if one of its…
In the recent paper [17] the first experimental determination of the density matrix of a free electron beam has been reported. The employed method leads to a linear inverse problem with a positive semidefinite operator as unknown. The…
Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the…
This paper proposes an improved cellular automaton traffic flow model based on the brake light model, which takes into account that the desired time gap of vehicles is remarkably larger than one second. Although the hypothetical steady…
In most models of traffic flow, the car density $p$ is the only free parameter in determining the average car velocity $\langle v \rangle$. The critical car density $p_c$, which is defined to be the car density separating the jamming phase…
Recent experiments by Springer and Kenyon have shown that a deep neural network can be trained to predict the action of $t$ steps of Conway's Game of Life automaton given millions of examples of this action on random initial states.…