Traced communication complexity of cellular automata

Details Traced communication complexity of cellular automata Traced communication complexity of cellular automata

2011-02-17

arxiv.org/abs/1102.3522v1

Computer Science

Formal Languages and Automata Theory

submitted to TCS

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Traced communication complexity of cellular automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Traced communication complexity of cellular automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traced communication complexity of cellular automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380323