Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
type: Item
instance of: scholarly article
title: Nonconstructible blocks in 1D cellular automata: minimal generators and natural systems
zbMATH Open document ID: 0927.68057
DOI: 10.1016/S0096-3003(97)10177-1
author: Andrew Adamatzky
published in: Applied Mathematics and Computation
publication date: 1999-06-29T00:00:00Z
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 1311118
zbMATH Keywords: cellular automata
MaRDI profile type: Publication
cites work: Q5615059
cites work: Q5638289
cites work: Q4000084
cites work: Q3802618
cites work: Q4023143
cites work: Q4840656
cites work: Computational Analysis of One-Dimensional Cellular Automata
cites work: Q5333602
cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: The constructibility of a configuration in a cellular automaton
cites work: Condition for injectivity of global maps for tessellation automata
cites work: Certain relations between properties of maps of tessellation automata
cites work: Q3805906
cites work: Invertible cellular automata: A review
cites work: Q3322005
description: scientific article; zbMATH DE number 1311118