Cellular automata and communication complexity

Authors:
Affiliations:
Venue:
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Year:
2004

Citing 3
Cited 6

The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
Communication complexity

Communication complexity
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Communication complexity and intrinsic universality in cellular automata

Theoretical Computer Science
Communication complexity in number-conserving and monotone cellular automata

Theoretical Computer Science
Traced communication complexity of cellular automata

Theoretical Computer Science
Discovering the rules of a elementary one-dimensional automaton

IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on communication complexity theory and, as a by-product, we provide (yet another) classification of cellular automata.