Related papers: Von Neumann Regular Cellular Automata
Cellular automata (CA) dynamics are ordered in terms of two global parameters, computable {\sl a priori} from the description of rules. While one of them (activity) has been used before, the second one is new; it estimates the average…
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…
Stephen Wolfram proclaimed in his 2003 seminal work "A New Kind Of Science" that simple recursive programs in the form of Cellular Automata (CA) are a promising approach to replace currently used mathematical formalizations, e.g.…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
The gauge principle is at the heart of a good part of fundamental physics: Starting with a group G of so-called rigid symmetries of a functional defined over space-time Sigma, the original functional is extended appropriately by additional…
Let $R$ be a ring with $char(R)\neq2$ whose unit group are denoted by $\mathcal{U}(R)$, $G$ a group with involution $*$, and $\sigma:G\rightarrow\mathcal{U}(R)$ a nontrivial group homomorphism, with $ker\ \sigma=N$, satisfying $xx^*\in N$…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton…
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…
Recently is has been proved that if $\sigma\in GL_n(R)$ where $R$ is an commutative ring and $n\geq 3$, then each of the elementary transvections $t_{kl}(\sigma_{ij})~(i\neq j,k\neq l)$ is a product of eight $E_n(R)$-conjugates of $\sigma$…
Deep learning techniques have recently demonstrated broad success in predicting complex dynamical systems ranging from turbulence to human speech, motivating broader questions about how neural networks encode and represent dynamical rules.…
This study focuses on an extended model of a standard cellular automaton (CA) that includes an extra index consisting of a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Extended…
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…
We say that a function F(tau) obeys WDVV equations, if for a given invertible symmetric matrix eta^{alpha beta} and all tau \in T \subset R^n, the expressions c^{alpha}_{beta gamma}(tau) = eta^{alpha lambda} c_{lambda beta gamma}(tau) =…
Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
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…
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph…
For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal…
Let $G$ be a group, $F$ a field, and $A$ a finite-dimensional central simple algebra over $F$ on which $G$ acts by $F$-algebra automorphisms. We study the ideals and subalgebras of $A$ which are preserved by the group action. Let $V$ be the…