论文信息 - Some Clarifications of the Concept of a Garden-of-Eden Configuration

Some Clarifications of the Concept of a Garden-of-Eden Configuration

The relationships between the concepts of Garden-of-Eden configurations and restrictions, mutually erasable configurations, and injective parallel transformations are considered for the tessellation structure which is a model of a uniformly interconnected array of identical finite-state machines.

Serafino Amoroso | Yale N. Patt | Gerald Cooper

[1] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[2] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[3] R. A. Bull. Review: John Thomas Canty, Systems Classically Axiomatized and Properly Contained in Lewis's $S3$ , 1968 .

[4] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.