Computation and construction universality of reversible cellular automata

Cites Work

Information Theory and Statistical Mechanics
Logical Reversibility of Computation
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
On reversibility in cellular automata
Title not available (Why is that?)
Tesselations with local transformations
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Tessellation Automata

Cited In (59)

The complexity of iterated reversible computation
Reversibility of elementary cellular automata with fully asynchronous updating: an analysis of the rules with partial recurrence
On a class of PCA with size-3 neighborhood and their applications in percolation games
The entropy and reversibility of cellular automata on Cayley tree
On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view
A comprehensive taxonomy of cellular automata
A survey of cellular automata: types, dynamics, non-uniformity and applications
Title not available (Why is that?)
Title not available (Why is that?)
Real-time reversible iterative arrays
A computation-universal two-dimensional 8-state triangular reversible cellular automaton
Fast reversible language recognition using cellular automata
How can we construct reversible machines out of reversible logic element with memory?
Two-dimensional cellular automata
Intractable problems in reversible cellular automata
Computation in reversible cellular automata
On time reduction and simulation in cellular spaces
Reversible parallel computation: An evolving space-model
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
Reversible computing and cellular automata -- a survey
Conservative logic
Frontier between decidability and undecidability: A survey
Computation-universality of one-dimensional one-way reversible cellular automata
Simulation and intrinsic universality among reversible cellular automata, the partition cellular automata leverage
Title not available (Why is that?)
Bicontinuous extensions of invertible combinatorial functions
Spatial/kinematic domain and lattice computers
Intrinsically universal \(n\)-dimensional quantum cellular automata
Partitioned quantum cellular automata are intrinsically universal
Theory of cellular automata: a survey
Self-reproduction in a reversible cellular space
Number-conserving reversible cellular automata and their computation-universality
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
Reversible space-time simulation of cellular automata
The attractor-basin portrait of a cellular automaton
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
Reversible cellular automata with memory: two-dimensional patterns from a single site seed
Invertible cellular automata: A review
Fundamentals of reversible flowchart languages
On the structure of the set of reversible cellular automata
Generation of invertible functions
Reversibility problem of multidimensional finite cellular automata
ONE-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS FROM A SINGLE SITE SEED
Algebraic properties of linear cellular automata
When-and how-can a cellular automaton be rewritten as a lattice gas?
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Reversible computation in term rewriting
The Operators of Vector Logic
An instruction set for reversible Turing machines
Surprising areas in the quest for small universal devices
Universality of Reversible Hexagonal Cellular Automata
Computation theoretic aspects of cellular automata
Intrinsic universality of a 1-dimensional reversible cellular automaton
Nondeterministic cellular automata
On the dynamical behaviour of linear higher-order cellular automata and its decidability
Universality of a reversible two-counter machine
Some reversible image operators from the point of view of cellular automata
Reversible simulation of one-dimensional irreversible cellular automata
The computing power of determinism and reversibility in chemical reaction automata

This page was built for publication: Computation and construction universality of reversible cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241491)