Cellular automata are simple models of computation which exhibit fascinatingly complex
behavior. They have captured the attention of several generations of researchers, leading to …

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 …

A cellular automaton is a dynamical system on an infinite array of cells defined by a local
update rule that is applied simultaneously at all cells. By carefully choosing the update rule …

Quantum cellular automata are alternative quantum-computing paradigms to quantum
Turing machines and quantum circuits. Their working mechanisms are inherently …

Reversible cellular automata (RCA) are models of massively parallel computation that
preserve information. This paper is a short survey of research on reversible cellular …

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 …

There have been several non-axiomatic approaches taken to define quantum cellular
automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic …

We investigate a problem whether self-reproduction is possible in a two-dimensional
“reversible” cellular space, and give an affirmative answer. A reversible (or injective) cellular …

This paper deals with simulation and reversibility in the context of Cellular Automata (ca).
We recall the definitions of ca and of the Block (bca) and Partitioned (pca) subclasses. We …

Essentially, in a reversible programming language, for each forward computation from state
S to state S′, there exists a constructive method to go backwards from state S′ to state S …