Reversible cellular automaton

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Gauge-invariance is a fundamental concept in physics—known to provide mathematical justifications for the fundamental forces. In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
In this paper, the authors give the definitions of a coprime sequence and a lever function, and describe the five algorithms and… (More)
Is this relevant?
2002
2002
Due to inevitable power dissipation, it is said that nano-scaled computing devices should perform their computing processes in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the deenitions of ca and… (More)
Is this relevant?
1996
1996
We demonstrate the structural invertibility of all reversible one- and two-dimensional cellular automata. More precisely, we… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA… (More)
  • table 1
  • figure 1
Is this relevant?
1995
1995
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent… (More)
Is this relevant?
1992
1992
We propose the use of reversible cellular automata (RCA) as eecient encryp-tion and decryption devices. The eeciency is due to… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An arbitrary d-dimensional cellular automaton can be constructively embedded in a reversible one having d + 1 dimensions. In… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.4
  • figure 3.1
Is this relevant?