Traced communication complexity of Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2011

Traced communication complexity of Cellular Automata

Résumé

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.

Dates et versions

hal-01281009 , version 1 (01-03-2016)

Identifiants

Citer

Eric Goles, Pierre Guillon, Ivan Rapaport. Traced communication complexity of Cellular Automata. Theoretical Computer Science, 2011, 412: Cellular Automata and Discrete Complex Systems (30), pp.3906--3916. ⟨10.1016/j.tcs.2011.02.025⟩. ⟨hal-01281009⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More