CORR
2011
Springer
12 years 12 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...