Related papers: Cellular automata over algebraic structures
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
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…
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,…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
Cellular automata provide models of parallel computation based on cells, whose connectivity is given by an action of a monoid on the cells. At each step in the computation, every cell is decorated with a state that evolves in discrete steps…
For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…
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 study the family of two-state Totalistic Freezing Cellular Automata (TFCA) defined over the triangular and square grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
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…
Cellular Automata (CA) theory is a discrete model that represents the state of each of its cells from a finite set of possible values which evolve in time according to a pre-defined set of transition rules. CA have been applied to a number…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
We study cellular automata on the unoriented $k$-regular tree $T_k$, i.e. continuous maps acting on colorings $T_k$ which commute with all automorphisms of the tree. We prove that every CA that is asymptotically nilpotent, meaning every…
We study limit sets of stable cellular automata standing from a symbolic dynamics point of view where they are a special case of sofic shifts admitting a steady epimorphism. We prove that there exists a right-closing almost-everywhere…
The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given…
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…
The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…
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.…
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 investigate the ability of a genetic algorithm to design cellular automata that perform computations. The computational strategies of the resulting cellular automata can be understood using a framework in which ``particles'' embedded in…