34 search results - page 3 / 7 » Communication complexity and intrinsic universality in cellu... |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
101
Voted
JAC
2008
14 years 11 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation...
JAC
2008
14 years 11 months ago
2008
In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgam...