Graph-theoretical characterization of invertible cellular automata
type: Item
instance of: scholarly article
title: Graph-theoretical characterization of invertible cellular automata
zbMATH Open document ID: 0970.68111
DOI: 10.1016/S0167-2789(00)00020-8
published in: Physica D
publication date: 2000-10-08T00:00:00Z
review text: The paper considers invertible cellular automata (which are described by induced surjective global rule on the set of finite configurations). Invertibility is characterized by graph-theoretical conditions. This allows construction of complete families of various invertible automata, viewed as discrete dynamical systems.
reviewed by: Vladimir Răsvan
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 37B99
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 37B15
zbMATH DE Number: 1514729
zbMATH Keywords: invertible cellular automata
Wikidata QID: Q56621452
author: Hendrik Moraal
describes a project that uses: avida
MaRDI profile type: Publication
cites work: Q4372516
cites work: Computation theory of cellular automata
cites work: Q5551465
cites work: Q3392273
cites work: Simple Computation-Universal Cellular Spaces
cites work: Q3212314
cites work: Q5333602
cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
cites work: Tesselations with local transformations
cites work: Invertible cellular automata: A review
cites work: Computation theoretic aspects of cellular automata
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Local maps inducing surjective global maps of one-dimensional tessellation automata
cites work: Q3805906
cites work: Predecessors of cellular automata states. I: Additive automata
cites work: Predecessors of cellular automata states. II: Pre-images of finite sequences
cites work: Predecessors of cellular automata states. III: Garden of Eden classification of cellular automata
cites work: Reversibility of 2D cellular automata is undecidable
cites work: Two-dimensional cellular automata
cites work: Decidability for some problems of linear cellular automata over finite commutative rings
cites work: Additive cellular automata and global injectivity
cites work: Predicting nonlinear cellular automata quickly by decomposing them into linear ones
cites work: Q5834367
cites work: Q4022642
cites work: Q4385615
cites work: Q4198056
cites work: Partially permutive cellular automata
cites work: Quasilinear cellular automata
cites work: Classical, discrete spin models: Symmetry, duality and renormalization
cites work: Endliche Gruppen I
cites work: Q3941595
cites work: Q4124997
cites work: Q5733161
cites work: Q4398864
cites work: Q4039680
cites work: Q4373704
description: scientific article; zbMATH DE number 1514729