Sciweavers

5 search results - page 1 / 1
» Reversible Cellular Automaton Able to Simulate Any Other Rev...
Sort
View
LATIN
1995
Springer
14 years 2 months ago
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...
Jérôme Olivier Durand-Lose
STACS
1997
Springer
14 years 3 months ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
MCU
1998
154views Hardware» more  MCU 1998»
14 years 10 days ago
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is injective and every configuration has at most one predecessor. Margolus showed that the...
Katsunobu Imai, Kenichi Morita
TCS
2011
13 years 6 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 10 months ago
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
Laurent Boyer, Guillaume Theyssier