Partitioning automata (PA) are defined. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any configuration
We introduce a new model of cellular automaton called a one-dimensional number-conserving partition...
A reversible elementary triangular partitioned cellular automaton ETPCA 0347 is a very simple rever...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
International audienceThis chapter presents the use of Partitioned Cellular Automata —introduced by ...
AbstractThe goal of this paper is to design a reversible d-dimensional cellular automaton which is c...
Reversibility corresponds to the conservation of information and energy. It allows unambiguous backt...
A reversible cellular automaton (CA) is a "backward deterministic" CA, i.e, every configuration of i...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitione...
An arbitrary d-dimensional cellular automaton can be constructively embedded in areversible one havi...
Abstract. Partitioned cellular automata are a variant of cellular automata that was defined in order...
We show how reversible computers can be built in very simple two-dimensional cellular automata calle...
A reversible cellular automaton (RCA) is regarded as a mathematical model for spatiotemporal phenome...
A reversible (or injective) cellular automaton (RCA) is a "backward deterministic" CA, i.e., every c...
AbstractA cellular automaton (CA) is called reversible (or injective) iff its global function is one...
Eight-state isotropic triangular partitioned cellular automata (TPCAs) are called elementary TPCAs (...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partition...
A reversible elementary triangular partitioned cellular automaton ETPCA 0347 is a very simple rever...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
International audienceThis chapter presents the use of Partitioned Cellular Automata —introduced by ...
AbstractThe goal of this paper is to design a reversible d-dimensional cellular automaton which is c...
Reversibility corresponds to the conservation of information and energy. It allows unambiguous backt...
A reversible cellular automaton (CA) is a "backward deterministic" CA, i.e, every configuration of i...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partitione...
An arbitrary d-dimensional cellular automaton can be constructively embedded in areversible one havi...
Abstract. Partitioned cellular automata are a variant of cellular automata that was defined in order...
We show how reversible computers can be built in very simple two-dimensional cellular automata calle...
A reversible cellular automaton (RCA) is regarded as a mathematical model for spatiotemporal phenome...
A reversible (or injective) cellular automaton (RCA) is a "backward deterministic" CA, i.e., every c...
AbstractA cellular automaton (CA) is called reversible (or injective) iff its global function is one...
Eight-state isotropic triangular partitioned cellular automata (TPCAs) are called elementary TPCAs (...
We introduce a new model of cellular automaton called a one-dimensional number-conserving partition...
A reversible elementary triangular partitioned cellular automaton ETPCA 0347 is a very simple rever...
AbstractIn this survey, we deal with the problem how a universal computer can be constructed in a re...
DOI
Add to ORKG