Some clarifications of the concept of a Garden-of-Eden configuration
- 1 February 1975
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 10 (1) , 77-82
- https://doi.org/10.1016/s0022-0000(75)80015-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Classes of languages and linear-bounded automataInformation and Control, 1964
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958