𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of reversible cellular automata

✍ Scribed by K. Sutner

Book ID
108280968
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
242 KB
Volume
325
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Reversible space–time simulation of cell
Reversible space–time simulation of cellular automata
✍ JΓ©rΓ΄me O. Durand-Lose πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 276 KB

The goal of this paper is to design a reversible d-dimensional cellular automaton which is capable of simulating the behavior of any given d-dimensional cellular automaton over any given conΓΏguration (even inΓΏnite) with respect to a well suited notion of simulation we introduce. We generalize a prob

The set of reversible 90150 cellular aut
The set of reversible 90150 cellular automata is regular
✍ Palash Sarkar; Rana Barua πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 869 KB

The reversibility problem for 90/150 cellular automata (both null and periodic boundary) is tackled using continua& and regular expressions. A 90/150 cellular automata can be uniquely encoded by a string over the alphabet (0, 1). It is shown that the set of strings which correspond to reversible 90/