相关论文: Discrete Baker Transformation and Cellular Automat…

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…

Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…

Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…

In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…

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…

This work studies Temporally Non-Uniform Cellular Automata (t-NUCAs), a variant of non-uniform cellular automata, which temporally use two rules in a sequence during their evolution. The one-dimensional t-NUCAs, under finite as well as…

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 present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…

We introduce an efficient cellular automaton for the coagulation-fission process with diffusion 2A->3A, 2A->A in arbitrary dimensions. As the well-known Domany-Kinzel model, it is defined on a tilted hypercubic lattice and evolves by…

A wide family of nonlinear sequence generators, the so-called clock-controlled shrinking generators, has been analyzed and identified with a subset of linear cellular automata. The algorithm that converts the given generator into a linear…

We provide a categorical procedure to turn graphs corresponding to state spaces of finite state machines into boolean circuits, leveraging on the fact that boolean circuits can be easily turned into zk-SNARKS. Our circuits verify that a…

If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum…

Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…

We study a quantum cellular automaton (QCA) whose time-evolution is defined from global transition function of classical cellular automata (CA). In order to investigate natural transformations from CA to QCA, the present QCA includes CA…

We propose a calibrated two-dimensional cellular automaton model to simulate pedestrian motion behavior. It is a v=4 (3) model with exclusion statistics and random shuffled dynamics. The underlying regular grid structure results in a…

If L=Z^D and A is a finite set, then A^L is a compact space. A cellular automaton (CA) is a continuous transformation F:A^L--> A^L that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by…

We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…

This paper introduces a hierarchical cellular automaton (HCA)model for simulation of distributed self-organizing control of traffic signals at intersections in road network. The proposed HCA consists of three hierarchy levels that describe…

We study spontaneous symmetry breaking in a one-dimensional driven two-species stochastic cellular automaton with parallel sublattice update and open boundaries. The dynamics are symmetric with respect to interchange of particles. Starting…

Probabilistic cellular automata (CA) provides a classic framework for studying non-equilibrium statistical physics on a lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed…