相关论文: Jointly periodic points in cellular automata: comp…
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
We show that the set of strictly temporally periodic points of cellular automata with almost equicontinuous points is dense in the topological support of the measure. This extends a result of Lena, Margara and Dennunzio about the density of…
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…
In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…
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.
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
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 are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.
This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…
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,…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the…
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…