Related papers: Control of cellular automata
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
The problem `human and work' in a model working group is investigated by means of cellular automata technique. Attitude of members of a group towards work is measured by an indicator of loyalty to the group (the number of agents who carry…
Coupled phase oscillators model a variety of dynamical phenomena in nature and technological applications. Non-local coupling gives rise to chimera states which are characterized by a distinct part of phase-synchronized oscillators while…
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…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
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…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
Global dynamics of a non-linear Cellular Automata is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In the past efforts have been made to systematize…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…
Cellular automata (CA) play an important role in the development of computationally efficient microscopic traffic models and recently have gained considerable importance as a mean of optimising traffic control strategies. However, real-time…
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bi-dimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential…
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…
In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…
Output feedback controlled synchronization problems for a class of nonlinear unstable systems under information constraints imposed by limited capacity of the communication channel are analyzed. A binary time-varying coder-decoder scheme is…
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…
Distributed control algorithms are known to reduce overall computation time compared to centralized control algorithms. However, they can result in inconsistent solutions leading to the violation of safety-critical constraints. Inconsistent…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
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…