Related papers: A class of cellular automata equivalent to determi…
State-of-the-art review of cellular automata, cellular automata for partial differential equations, differential equations for cellular automata and pattern formation in biology and engineering.
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at…
Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…
It is shown that for the N-neighbor and K-state cellular automata, the class II, class III and class IV patterns coexist at least in the range $\frac{1}{K} \le \lambda \le 1-\frac{1}{K} $. The mechanism which determines the difference…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interval Markov Chains. In this context, we consider the…
Stochastic processes govern the time evolution of a huge variety of realistic systems throughout the sciences. A minimal description of noisy many-particle systems within a Markovian picture and with a notion of spatial dimension is given…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
Biology stores information and computes at the molecular scale, yet the ways in which it does so are often distinct from human-engineered computers. Mapping biological computation onto architectures familiar to computer science remains an…
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…
We introduce a new setting, the category of $\omega$PAP spaces, for reasoning denotationally about expressive differentiable and probabilistic programming languages. Our semantics is general enough to assign meanings to most practical…
Texture recognition is one of the most important tasks in computer vision and, despite the recent success of learning-based approaches, there is still need for model-based solutions. This is especially the case when the amount of data…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the emptiness problem for alternating nonzero automata to the same…
We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single…
Cellular automata can show well known features of quantum mechanics, such as a linear updating rule that resembles a discretized form of the Schr\"odinger equation together with its conservation laws. Surprisingly, a whole class of…
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…