Reversible space-time simulation of cellular automata
type: Item
instance of: scholarly article
title: Reversible space-time simulation of cellular automata
zbMATH Open document ID: 0971.68110
DOI: 10.1016/S0304-3975(99)00075-4
author: Jérôme O. Durand-Lose
published in: Theoretical Computer Science
publication date: 2000-10-31T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 1522114
zbMATH Keywords: cellular automaton
MaRDI profile type: Publication
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Reversible cellular automaton able to simulate any other reversible one using partitioning automata
cites work: Intrinsic universality of a 1-dimensional reversible Cellular Automaton
cites work: Generation of Primes by a One-Dimensional Real-Time Iterative Array
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Linear speed-up for cellular automata synchronizers and applications
cites work: Reversibility of 2D cellular automata is undecidable
cites work: Computations on one-dimensional cellular automata
cites work: Q5333602
cites work: Computation-universality of one-dimensional one-way reversible cellular automata
cites work: Reversible simulation of one-dimensional irreversible cellular automata
cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
cites work: Tesselations with local transformations
cites work: Computation and construction universality of reversible cellular automata
Wikidata QID: Q127983135
description: scientific article; zbMATH DE number 1522114