Author pages are created from data sourced from our academic publisher partnerships and public sources.
Traced communication complexity of cellular automata
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. Expand
Comportement dynamique de réseaux d'automates. (Dynamical behaviour of automata networks)
- E. Ch.
- Computer Science