Related papers: Solving two-dimensional density classification pro…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
This paper presents a new class of one-dimensional (1D) traffic models with look-ahead rules that take into account of two effects: nonlocal slow-down effect and right-skewed non-concave asymmetry in the fundamental diagram. The proposed 1D…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
For many cellular automata, it is possible to express the state of a given cell after $n$ iterations as an explicit function of the initial configuration. We say that for such rules the solution of the initial value problem can be obtained.…
We examine a simple two lane cellular automaton based upon the single lane CA introduced by Nagel and Schreckenberg. We point out important parameters defining the shape of the fundamental diagram. Moreover we investigate the importance of…
We focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…
This paper considers the problem of steering an arbitrary initial probability density function to an arbitrary terminal one, where the system dynamics is governed by a first-order linear stochastic difference equation. It is a…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
Some deterministic cellular automata have been observed to follow the pattern of the second law of thermodynamics: starting from a partially disordered state, the system evolves towards a state of equilibrium characterized by maximal…
Motivated by an attempt to develop a method for solving initial value problems in a class of one dimensional periodic cellular automata (CA) associated with crystal bases and soliton equations, we consider a generalization of a simple…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
A new stochastic cellular automaton (CA) model of traffic flow, which includes slow-to-start effects and a driver's perspective, is proposed by extending the Burgers CA and the Nagel-Schreckenberg CA model. The flow-density relation of this…
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…
In this paper we present a theoretical analysis of a recently proposed two-dimensional Cellular Automata model for traffic flow in cities with the novel ingredient of turning capability. Numerical simulations of this model show that there…
We investigate dynamics of the cellular automaton rule 142. This rule possesses additive invariant of the second order, namely it conserves the number of blocks 10. Rule 142 can be alternatively described as an operation on a binary string…