Amoroso, Serafino; Cooper, Gerald; Patt, Yale Some clarifications of the concept of a Garden-of-Eden configuration. (English) Zbl 0348.94056 J. Comput. Syst. Sci. 10, 77-82 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 Show Scanned Page Cited in 9 Documents MSC: 68Q45 Formal languages and automata 03D05 Automata and formal grammars in connection with logical questions PDFBibTeX XMLCite \textit{S. Amoroso} et al., J. Comput. Syst. Sci. 10, 77--82 (1975; Zbl 0348.94056) Full Text: DOI References: [1] Friedberg, R. M., Three theorems on recursive enumeration, J. Symbolic Logic, 33, 309-316 (1958) · Zbl 0088.01601 [2] Kuroda, S. Y., Classes of languages and linearly bounded automata, Information and Control, 2, 207-223 (1964) · Zbl 0199.04002 [3] Sařitch, W. J., Relations between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4, 177-192 (1970) · Zbl 0188.33502 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.