Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures

After demonstrating the existence of nontrivial information Jossless parallel maps on one-dimensional iterative array configurations, algorithms are presented for deciding the injectivity or surjectivity of the global maps given their defining local maps. Whether or not these properties are independent of neighborhood interconnection patterns is also considered.

[1]  W. Beyer.  RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS , 1969 .

[2]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[3]  Michael A. Arbib,et al.  Simple Self-Reproducing Universal Automata , 1966, Inf. Control..

[4]  Nils Aall Barricelli,et al.  Numerical testing of evolution theories , 1962 .

[5]  S. H. Unger,et al.  Pattern Detection and Recognition , 1959, Proceedings of the IRE.

[6]  D. Richardson,et al.  Tessellations with Local Transformations , 1972, J. Comput. Syst. Sci..

[7]  Alvy Ray Smith,et al.  Cellular Automata Complexity Trade-Offs , 1971, Inf. Control..

[8]  C. Y. Lee.  Intercommunicating cells, basis for a distributed logic computer , 1962, AFIPS '62 (Fall).

[9]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.

[10]  Alvy Ray Smith,et al.  Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata , 1971, SWAT.

[11]  Nils Aall Barricelli,et al.  Numerical testing of evolution theories , 1963 .

[12]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[13]  Serafino Amoroso,et al.  Structural and Behavioral Equivalences of Tessellation Automata , 1971, Inf. Control..

[14]  S. H. Unger,et al.  A Computer Oriented toward Spatial Problems , 1899, Proceedings of the IRE.

[15]  E. F. Codd,et al.  Cellular automata , 1968 .

[16]  Serafino Amoroso,et al.  A Completeness Problem for Pattern Generation in Tessellation Automata , 1970, J. Comput. Syst. Sci..