STACS
2009
Springer
14 years 6 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
LATA
2009
Springer
14 years 6 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
STACS
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
WWW
2006
ACM
15 years 8 days ago
2006
ACM
