9 search results - page 1 / 2 » Intrinsic Universality of a 1-Dimensional Reversible Cellula... |
STACS
1997
Springer
13 years 9 months ago
1997
Springer
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...
TCS
2011
12 years 11 months ago
2011
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...
LATIN
1995
Springer
13 years 8 months ago
1995
Springer
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...
TCS
2011
12 years 11 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...