The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The proof consists in a reduction of a problem concerning finite tilings into the previous one. This reduction uses a special and very sophisticated tile set. In this article, we present a much more simple tile set which can play the same role
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractIn this paper, we prove the co-RNP-completeness (RNP = Random NP) of the following decision ...
One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden t...
The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
AbstractIn this paper, it is established that strong surjectivity of parallel maps for cellular auto...
AbstractWe define four new properties of parallel maps for cellular automata, viz., strong surjectiv...
AbstractIn this paper, we prove the co-RNP-completeness (RNP = Random NP) of the following decision ...
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of...
For and d≥2, it is recursively unsolvable if the global mapping for a d-dimensionalnondeterministic ...
Cellular automata are models for massively parallel computation. A cellular automaton consists of ce...
AbstractThis article surveys some theoretical aspects of cellular automata CA research. In particula...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractIn this paper, we prove the co-RNP-completeness (RNP = Random NP) of the following decision ...
One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden t...
The surjectivity problem for 2D cellular automata was proved undecidable in 1989 by Jarkko Kari. The...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
The problem of deciding if a given cellular automaton (CA) is reversible (or, equivalently, if its g...
AbstractIn this paper, we prove the co-NP-completeness of the following decision problem: “Given a t...
AbstractIn this paper, it is established that strong surjectivity of parallel maps for cellular auto...
AbstractWe define four new properties of parallel maps for cellular automata, viz., strong surjectiv...
AbstractIn this paper, we prove the co-RNP-completeness (RNP = Random NP) of the following decision ...
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of...
For and d≥2, it is recursively unsolvable if the global mapping for a d-dimensionalnondeterministic ...
Cellular automata are models for massively parallel computation. A cellular automaton consists of ce...
AbstractThis article surveys some theoretical aspects of cellular automata CA research. In particula...
Part 2: Regular PapersInternational audienceWe discuss cellular automata over arbitrary finitely gen...
AbstractIn this paper, we prove the co-RNP-completeness (RNP = Random NP) of the following decision ...
One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden t...
DOI
Add to ORKG