Related papers: Finite entropy for multidimensional cellular autom…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from simple local interaction and computation. Since the inception of cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention of…
There exists algorithms to detect reversibility of cellular automaton (CA) for both finite and infinite lattices taking quadratic time. But, can we identify a $d$-state CA rule in constant time that is always reversible for every lattice…
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…
Let $F$ be a finite field of order $q$ and characteristic $p$. Let $\mathbb{Z}_F=F[t]$, $\mathbb{Q}_F=F(t)$, $\mathbb{R}_F=F((1/t))$ equipped with the discrete valuation for which $1/t$ is a uniformizer, and let…
Real-world computers have operational constraints that cause nonzero entropy production (EP). In particular, almost all real-world computers are ``periodic'', iteratively undergoing the same physical process; and ``local", in that…
If M is a monoid (e.g. the lattice Z^D), and A is an abelian group, then A^M is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. If F is diffusive, and…
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…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…
We show that the (Gurevich) topological entropy for the countable Markov shift associated with an infinite transition matrix $A$ coincides with the non-commutative topological entropy for the Exel--Laca algebra associated with $A$, under…
In a recent paper Sutner proved that the first-order theory of the phase-space $\mathcal{S}_\mathcal{A}=(Q^\mathbb{Z}, \longrightarrow)$ of a one-dimensional cellular automaton $\mathcal{A}$ whose configurations are elements of…
The category of quasi frames (or qframes) is introduced and studied. In the context of qframes we can jointly study problems related to the L-Surjunctivity and Stable Finiteness Conjectures. As a consequences of our main results, we can…
Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images weak *-converge…
For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…
Let $G$ be a group and $A$ a set. A cellular automaton (CA) $\tau$ over $A^G$ is von Neumann regular (vN-regular) if there exists a CA $\sigma$ over $A^G$ such that $\tau \sigma\tau = \tau$, and in such case, $\sigma$ is called a…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
In this paper, we study avoshifts and unishifts on $\mathbb{Z}^d$. Avoshifts are subshifts where for each convex set $C$, and each vector $v$ such that $C \cup \{\vec v\}$ is also convex, the set of valid extensions of globally valid…