The constructibility of a configuration in a cellular automaton
- 1 October 1973
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 7 (5), 481-496
- https://doi.org/10.1016/s0022-0000(73)80004-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some regular state sets in the system of one-dimensional iterative automataInformation Sciences, 1973
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structuresJournal of Computer and System Sciences, 1972
- Pattern reproduction in tessellation automata of arbitrary dimensionJournal of Computer and System Sciences, 1971
- Tessellation structures for reproduction of arbitrary patternsJournal of Computer and System Sciences, 1971
- Simple Computation-Universal Cellular SpacesJournal of the ACM, 1971
- Structural and behavioral equivalences of tessellation automataInformation and Control, 1971
- The Garden-of-Eden theorem for finite configurationsProceedings of the American Mathematical Society, 1970
- A completeness problem for pattern generation in tessellation automataJournal of Computer and System Sciences, 1970
- Computing ability of a developmental model for filamentous organismsJournal of Theoretical Biology, 1969
- Machines models of self-reproductionPublished by American Mathematical Society (AMS) ,1962