English
Related papers

Related papers: Von Neumann Regular Cellular Automata

200 papers

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…

Statistical Mechanics · Physics 2011-08-22 Erik Edlund , Martin Nilsson Jacobi

We show that a wide variety of non-linear cellular automata (CAs) can be decomposed into a quasidirect product of linear ones. These CAs can be predicted by parallel circuits of depth O(log^2 t) using gates with binary inputs, or O(log t)…

patt-sol · Physics 2009-10-30 Cristopher Moore

Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…

Discrete Mathematics · Computer Science 2007-05-23 Gilson A. Giraldi , Antonio A. F. Oliveira , Leonardo Carvalho

Wolfram has provided a qualitative classification of cellular automata(CA) rules according to which, there exits a class of CA rules (called Class 4) which exhibit complex pattern formation and long-lived dynamical activity (long…

Condensed Matter · Physics 2015-06-25 Avinash Dhar , Porus Lakdawala , Gautam Mandal , Spenta R. Wadia

Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in…

Cellular Automata and Lattice Gases · Physics 2024-06-11 Chen Wang , Xiang Deng , Chao Wang

Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

This paper proposes a generalized framework for cellular automata using the language of category theory, extending the classical definition beyond set-theoretic constraints. For an arbitrary category $\mathscr{C}$ with products, we define…

Formal Languages and Automata Theory · Computer Science 2026-02-05 A. Castillo-Ramirez , A. Vazquez-Aceves , A. Zaldivar-Corichi

We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…

Quantum Physics · Physics 2022-04-21 Michael Freedman , Jeongwan Haah , Matthew B. Hastings

We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…

Formal Languages and Automata Theory · Computer Science 2023-09-06 Eric Rowland , Reem Yassawi

In this paper, a different perspective of constructing the CA models is proposed. Its kernel, the Local Symmetric Distribution Principle, relates to some fundamental concepts in physics, which maybe raise a wide interest. With a rich…

Cellular Automata and Lattice Gases · Physics 2010-07-27 Zan Pan

A new formulation of special relativity is described. It is based on a postulate that the universe is a vast Cellular Automata (CA). We show that any CA model automatically leads to a maximum speed limit for the transfer of information from…

General Physics · Physics 2007-05-23 Tom Ostoma , Mike Trushyk

We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…

Quantum Physics · Physics 2015-08-03 Hans-Thomas Elze

Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…

Quantum Physics · Physics 2019-09-09 Pablo Arrighi

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…

Dynamical Systems · Mathematics 2009-09-25 Marcus Pivato , Reem Yassawi

This paper concerns $d$-dimensional cellular automata with the von Neumann neighborhood that conserve the sum of the states of all their cells. These automata, called number-conserving or density-conserving cellular automata, are of…

Mathematical Physics · Physics 2020-08-26 Barbara Wolnik , Anna Nenca , Jan M. Baetens , Bernard De Baets

In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…

Discrete Mathematics · Computer Science 2008-08-12 Sudhakar Sahoo , Sanjaya Sahoo , Birendra Kumar Nayak , Pabitra Pal Choudhury

Let $KG$ be the group ring of a group $G$ over a commutative ring $K$ with unity. The rings $KG$ are described for which $xx^\sigma=x^\sigma x$ for all $x=\sum_{g\in G}\alpha_gg\in KG$, where \quad $x\mapsto x^\sigma=~\sum_{g\in…

Rings and Algebras · Mathematics 2008-04-08 V. A. Bovdi , S. Siciliano

Let $(M,\tau,\sigma,\Gamma)$ be a (finite) von Neumann dynamical system and let $N$ be a $\Gamma$-invariant unital von Neumann subalgebra of $M$. If $V\subset L^2(M)$ is a right $N$-submodule whose projection $p_V$ has finite trace in $<…

Operator Algebras · Mathematics 2024-10-22 Paul Jolissaint

We study intrinsic simulations between cellular automata and introduce a new necessary condition for a CA to simulate another one. Although expressed for general CA, this condition is targeted towards surjective CA and especially linear…

Discrete Mathematics · Computer Science 2011-12-09 Vincent Nesme , Guillaume Theyssier

$\textbf{Theorem 1.2.}$ For a ring $A$, the following conditions are equivalent. $\textbf{1)}$ $A$ is a right automorphism-invariant right non-singular ring. $\textbf{2)}$ $A$ is a right automorphism-invariant regular ring. $\textbf{3)}$…

Rings and Algebras · Mathematics 2017-04-20 Askar Tuganbaev
‹ Prev 1 4 5 6 7 8 10 Next ›