International audienceStudying 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
Artículo de publicación ISIIn previous works we found necessary conditions for a cellular automaton ...
We study cellular automata with respect to a new communication complexity prob-lem: each of two play...
The intended goal of this manuscript is to build bridges between two definitions of complexity. One ...
International audienceStudying cellular automata with methods from communication complexity appears ...
International audienceStudying cellular automata with methods from communication complexity appears ...
Studying cellular automata with methods from communication complexity appears to be a promising appr...
The notions of universality and completeness are central in the theories of computation and computat...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
Artículo de publicación ISIThe notions of universality and completeness are central in the theories ...
Artículo de publicación ISIThe notions of universality and completeness are central in the theories ...
AbstractWe study cellular automata with respect to a new communication complexity problem: each of t...
AbstractThe model of cellular automata is fascinating because very simple local rules can generate c...
We study the model of cellular automata through two complementary aspects: local syntactic represent...
We study the model of cellular automata through two complementary aspects: local syntactic represent...
Artículo de publicación ISIIn previous works we found necessary conditions for a cellular automaton ...
We study cellular automata with respect to a new communication complexity prob-lem: each of two play...
The intended goal of this manuscript is to build bridges between two definitions of complexity. One ...
International audienceStudying cellular automata with methods from communication complexity appears ...
International audienceStudying cellular automata with methods from communication complexity appears ...
Studying cellular automata with methods from communication complexity appears to be a promising appr...
The notions of universality and completeness are central in the theories of computation and computat...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
AbstractThe notions of universality and completeness are central in the theories of computation and ...
Artículo de publicación ISIThe notions of universality and completeness are central in the theories ...
Artículo de publicación ISIThe notions of universality and completeness are central in the theories ...
AbstractWe study cellular automata with respect to a new communication complexity problem: each of t...
AbstractThe model of cellular automata is fascinating because very simple local rules can generate c...
We study the model of cellular automata through two complementary aspects: local syntactic represent...
We study the model of cellular automata through two complementary aspects: local syntactic represent...
Artículo de publicación ISIIn previous works we found necessary conditions for a cellular automaton ...
We study cellular automata with respect to a new communication complexity prob-lem: each of two play...
The intended goal of this manuscript is to build bridges between two definitions of complexity. One ...