scholarly journals Traced communication complexity of cellular automata

2011 ◽  
Vol 412 (30) ◽  
pp. 3906-3916 ◽  
Author(s):  
Eric Goles ◽  
Pierre Guillon ◽  
Ivan Rapaport
2011 ◽  
Vol 412 (29) ◽  
pp. 3616-3628 ◽  
Author(s):  
E. Goles ◽  
A. Moreira ◽  
I. Rapaport

2011 ◽  
Vol DMTCS Proceedings vol. AP,... (Proceedings) ◽  
Author(s):  
Raimundo Briceño ◽  
Pierre-Etienne Meunier

International audience 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 to various "communication problems'', or "questions'' one might ask about the dynamics of cellular automata. In this article, we aim at structuring these problems, and find what makes them interesting for the study of intrinsic universality and quasi-orders induced by simulation relations.


2004 ◽  
Vol 322 (2) ◽  
pp. 355-368 ◽  
Author(s):  
Christoph Dürr ◽  
Ivan Rapaport ◽  
Guillaume Theyssier

2011 ◽  
Vol 412 (1-2) ◽  
pp. 2-21 ◽  
Author(s):  
E. Goles ◽  
P.-E. Meunier ◽  
I. Rapaport ◽  
G. Theyssier

2001 ◽  
Vol 11 (PR3) ◽  
pp. Pr3-205-Pr3-212
Author(s):  
G. Ch. Sirakoulis ◽  
I. Karafyllidis ◽  
A. Thanailakis
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document