相关论文: Quasi-Linear Cellular Automata

Cellular automaton (CA) approach is an important theoretical framework for studying complex system behavior and has been widely applied in various research field. CA traffic flow models have the advantage of flexible evolution rules and…

Cellular automata (CA) are simulation models that can produce complex emergent behaviors from simple local rules. Although state-of-the-art GPU solutions are already fast due to their data-parallel nature, their performance can rapidly…

An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…

A quantum cellular automaton (QCA) is an abstract model consisting of an array of finite-dimensional quantum systems that evolves in discrete time by local unitary operations. Here we propose a simple coarse-graining map, where the spatial…

The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…

In this paper, we develop a new cellular automata-based linear model for several nonlinear pseudorandom number generators with practical applications in symmetric cryptography. Such a model generates all the solutions of linear binary…

For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid…

In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the…

We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…

Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…

The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…

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…

We study the synchronization of totalistic one dimensional cellular automata (CA). The CA with a non zero synchronization threshold exhibit complex non periodic space time patterns and conversely. This synchronization transition is related…

This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming…

Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…

We have previously proposed a way of using coupled quantum dots to construct digital computing elements - quantum-dot cellular automata (QCA). Here we consider a different approach to using coupled quantum-dot cells in an architecture…

An equidistribution is a theoretical quality criteria that measures the uniformity of a linear pseudo-random number generator (PRNG). In this work, we first show that all existing linear cellular automaton (CA) based pseudo-random number…

The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…

If a cellular automaton (CA) is started with a single ON cell, how many cells will be ON after n generations? For certain "odd-rule" CAs, including Rule 150, Rule 614, and Fredkin's Replicator, the answer can be found by using the…

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,…