Related papers: Cellular Automata: From Structural Principles to T…
In this paper, we give an elaborate and understandable review of traffic cellular automata (TCA) models, which are a class of computationally efficient microscopic traffic flow models. TCA models arise from the physics discipline of…
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,…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…
The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…
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…
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order…
Cellular Automata (CA) are commonly investigated as a particular type of dynamical systems, defined by shift-invariant local rules. In this paper, we consider instead CA as algebraic systems, focusing on the combinatorial designs induced by…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…