The structure of communication problems in cellular automata

Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown. One of the last extensions of this theory was its generalization...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Raimundo Briceño, Pierre-Etienne Meunier
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Discrete Mathematics & Theoretical Computer Science 2011-01-01
Edice:	Discrete Mathematics & Theoretical Computer Science
Témata:	cellular automata communication complexity intrinsic universality ideals [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-ds] mathematics [math]/dynamical systems [math.ds] [nlin.nlin-cg] nonlinear sciences [physics]/cellular automata and lattice gases [nlin.cg] [math.math-co] mathematics [math]/combinatorics [math.co]
On-line přístup:	https://dmtcs.episciences.org/2977/pdf
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!