Cellular automata and communication complexity

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 pro...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 322; no. 2; pp. 355 - 368
Main Authors: Dürr, Christoph, Rapaport, Ivan, Theyssier, Guillaume
Format: Journal Article Conference Proceeding
Language:English
Published: Amsterdam Elsevier B.V 30.08.2004
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automata. Abstract machines. Turing machines
Cellular automata
Communication complexity
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Communication complexity
Cellular automata
Computer theory
Cellular automaton
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.03.017