Sciweavers

34 search results - page 2 / 7
» Communication complexity and intrinsic universality in cellu...
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 6 months ago
Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...
STACS
1997
Springer
13 years 9 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
TCS
2011
12 years 11 months ago
Four states are enough!
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 ...
Nicolas Ollinger, Gaétan Richard
IANDC
2008
139views more  IANDC 2008»
13 years 4 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 6 months ago
A Particular Universal Cellular Automaton
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...
Nicolas Ollinger, Gaétan Richard