Related papers: Cellular Automata and Ultra-Discrete Painlev\'e Eq…
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…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a…
Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…
Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries:…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
Using the concept of the Boolean derivative we study damage spreading for one dimensional elementary cellular automata and define their maximal Lyapunov exponent. A random matrix approximation describes quite well the behavior of…
Motivated by questions in biology and distributed computing, we investigate the behaviour of particular cellular automata, modelled as one-dimensional arrays of identical finite automata. We investigate what sort of self-stabilising…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem. In this paper we present a new two-dimensional CA model for solid dynamics. In this model the solid body is represented by a set of…
John H. Conway's Game of Life, as well as cellular automata in the larger family of Life-like CA, are discrete: the cells have a binary state space and the birth and survival transition rules are 9-bits apiece. Inspired by Life, several…
Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata…
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 propose a new approach to the study of integrable cases based on intensive computer methods' application. We make a new investigation of Kovalevskaya and Goryachev-Chaplygin cases of Euler-Poisson equations and obtain many…
We consider the orbits of a discrete Painlev\'e equation over finite fields and show that the number of points in such orbits satisfy the Hasse bound. The orbits turn out to lie on algebraic curves, whose defining polynomials are given…
We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…
In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the…
A cellular automaton that is a generalization of the box-ball system with either many kinds of balls or finite carrier capacity is proposed and studied through two discrete integrable systems: nonautonomous discrete KP lattice and…