Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

42

CORR
2011
Springer

favoriteEmaildiscussreport

175views Education» more CORR 2011»

Traced communication complexity of cellular automata

13 years 6 months ago

Traced communication complexity of cellular automata

Download www.dim.uchile.cl

We study cellular automata with respect to a new communication complexity problem: each of two players know half of some ﬁnite 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, expansivity, entropy and give the asymptotic communication complexity of most elementary cellular automata. Key words: cellular automata, communication complexity

Eric Goles Ch., Pierre Guillon, Ivan Rapaport

Real-time Traffic

Cellular Automata | Communication Complexity | Communication Complexity Problem | CORR 2011 | Education |

claim paper

Related Content

» Inferring Regular Trace Languages from Positive and Negative Samples

» On the Expressiveness of Asynchronous Cellular Automata

» Communications in cellular automata

» Communication complexity and intrinsic universality in cellular automata

» Cellular Devices and Unary Languages

» Collecting Statistics over Runtime Executions

» A hybrid finite automaton for practical deep packet inspection

» Building MiniGrid Environments with Virtual Private Networks A Pragmatic Approach

» Programming self developing blob machines for spatial computing

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Eric Goles Ch., Pierre Guillon, Ivan Rapaport

Comments (0)