Add to ORKGIn this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
Many properties of the dynamics of one-dimensional cellular automata are known to be undecidable. Ho...
18th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA & JAC 2012),...
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both p...
We construct a one-dimensional reversible cellular automaton that is computationally universal in...
A reversible cellular automaton (CA) is a "backward deterministic" CA, i.e, every configuration of i...
Abstract. This reading guide aims to provide the reader with an easy access to the study of universa...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitione...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partition...
AbstractNumber-conserving cellular automata (NCCA) are particularly interesting, both because of the...
International audienceThis chapter presents the use of Partitioned Cellular Automata —introduced by ...
An arbitrary d-dimensional cellular automaton can be constructively embedded in areversible one havi...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 11389 / INIST-CNRS - ...
Abstract: We consider one-dimensional cellular automata whose cells can use different local rules to...
In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
Many properties of the dynamics of one-dimensional cellular automata are known to be undecidable. Ho...
18th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA & JAC 2012),...
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both p...
We construct a one-dimensional reversible cellular automaton that is computationally universal in...
A reversible cellular automaton (CA) is a "backward deterministic" CA, i.e, every configuration of i...
Abstract. This reading guide aims to provide the reader with an easy access to the study of universa...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitione...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partition...
AbstractNumber-conserving cellular automata (NCCA) are particularly interesting, both because of the...
International audienceThis chapter presents the use of Partitioned Cellular Automata —introduced by ...
An arbitrary d-dimensional cellular automaton can be constructively embedded in areversible one havi...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 11389 / INIST-CNRS - ...
Abstract: We consider one-dimensional cellular automata whose cells can use different local rules to...
In this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellul...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
Many properties of the dynamics of one-dimensional cellular automata are known to be undecidable. Ho...