Related papers: Von Neumann Regular Cellular Automata
Let $G$ be a group. Let $X$ be a connected algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of $K$-points of $X$. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular…
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…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
Models of areas of physics in terms of cellular automata have become increasingly popular. Cellular automata (CAs) support the modeling of systems with discrete state component values and enforce the comprehensive specification of the…
In this paper we study $\nu$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $\nu$-CA has some properties. In a first part, we…
Let M=Z^D be a D-dimensional lattice, and let A be an abelian group. A^M is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism \Phi:A^M --> A^M that commutes with all shift maps. Suppose…
A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…
Let $G$ be a group and let $V$ be an algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $V$. We introduce algebraic sofic subshifts $\Sigma \subset A^G$ and study endomorphisms $\tau \colon…
Let $R$ be a ring and $S$ a multiplicative subset of $R$. An $R$-module $T$ is called $u$-$S$-torsion ($u$- always abbreviates uniformly) provided that $sT=0$ for some $s\in S$. The notion of $u$-$S$-exact sequences is also introduced from…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…
We prove a general criterion for a von Neumann algebra $M$ in order to be in standard form. It is formulated in terms of an everywhere defined, invertible, antilinear, a priori not necessarily bounded operator, intertwining $M$ with its…
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…
We consider a special configuration in which a finite group $A$ acts by automorphisms on the finite group $G$, and the semidirect product $GA$ acts on the vector space $V$ by linear transformations; and discuss the existence of the regular…
Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that…