Sciweavers

367 search results - page 4 / 74
» Amalgamation of cellular automata
Sort
View
IANDC
2008
139views more  IANDC 2008»
13 years 6 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
JAC
2008
13 years 7 months ago
Universalities in cellular automata a (short) survey
This reading guide aims to provide the reader with an easy access to the study of universality in the field of cellular automata. To fulfill this goal, the approach taken here is o...
Nicolas Ollinger
FUIN
2008
108views more  FUIN 2008»
13 years 6 months ago
Radial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function...
Paola Flocchini, Vladimir Cezar
MFCS
2004
Springer
13 years 11 months ago
Simulating 3D Cellular Automata with 2D Cellular Automata
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise w...
Victor Poupet
COMPLEXITY
2010
108views more  COMPLEXITY 2010»
13 years 3 months ago
How to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
Genaro Juárez Martínez, Andrew Adama...