Traced communication complexity of cellular automata
Formal Languages and Automata Theory
2011-02-18 v1 Dynamical Systems
Abstract
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 of the central cell will follow a given evolution, by communicating as little as possible between each other. We present some links with classical dynamical concepts, especially equicontinuity, expansiveness, entropy and give the asymptotic communication complexity of most elementary cellular automata.
Keywords
Cite
@article{arxiv.1102.3522,
title = {Traced communication complexity of cellular automata},
author = {Eric Goles and Pierre Guillon and Ivan Rapaport},
journal= {arXiv preprint arXiv:1102.3522},
year = {2011}
}
Comments
submitted to TCS