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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 322; číslo 2; s. 355 - 368
Hlavní autoři: Dürr, Christoph, Rapaport, Ivan, Theyssier, Guillaume
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 30.08.2004
Elsevier
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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