Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Authors:
S. Amoroso;Y. N. Patt
Affiliations:
U.S. Army Electronics Command, Ft. Monmouth, New Jersey, USA and Stevens Institute of Technology, Hoboken, New Jersey, USA;North Carolina State University, Raleigh, North Carolina, USA and U.S. Army Electronics Command, Ft. Monmouth, New Jersey, USA
Venue:
Journal of Computer and System Sciences
Year:
1972

Citing 5
Cited 35

Simple Computation-Universal Cellular Spaces

Journal of the ACM (JACM)
Two-dimensional formal languages and pattern recognition by cellular automata

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Intercommunicating cells, basis for a distributed logic computer

AFIPS '62 (Fall) Proceedings of the December 4-6, 1962, fall joint computer conference
A completeness problem for pattern generation in tessellation automata

Journal of Computer and System Sciences
Tessellations with local transformations

Journal of Computer and System Sciences

Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
Group structured linear cellular automata over Zm

Journal of Computer and System Sciences
Regular Article: The surjectivity problem for 2D cellular automata

Proceedings of the 30th IEEE symposium on Foundations of computer science
Algorithmic Information Theory and Cellular Automata Dynamics

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Intrinsic Universality Problem of One-Dimensional Cellular Automata

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Linear Cellular Automata with Multiple State Variables

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A tight linear bound on the synchronization delay of bijective automata

Theoretical Computer Science
Hybrid one-dimensional reversible cellular automata are regular

Discrete Applied Mathematics
Reversible computing and cellular automata—A survey

Theoretical Computer Science
When–and how–can a cellular automaton be rewritten as a lattice gas?

Theoretical Computer Science
Fast reversible language recognition using cellular automata

Information and Computation
Decidable Properties of 2D Cellular Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Surprising Areas in the Quest for Small Universal Devices

Electronic Notes in Theoretical Computer Science (ENTCS)
A Cryptosystem Based on the Composition of Reversible Cellular Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Characterization of 1-d Periodic Boundary Reversible CA

Electronic Notes in Theoretical Computer Science (ENTCS)
Real-time reversible iterative arrays

Theoretical Computer Science
On reversibility in cellular automata

Journal of Computer and System Sciences
The constructibility of a configuration in a cellular automaton

Journal of Computer and System Sciences
Cellular Automata, Decidability and Phasespace

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies

Natural Computing: an international journal
Bulking II: Classifications of cellular automata

Theoretical Computer Science
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata

Theoretical Computer Science
A tight linear bound on the neighborhood of inverse cellular automata

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Reversible cellular automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Algebraic characterizations of unitary linear quantum cellular automata

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On time-symmetry in cellular automata

Journal of Computer and System Sciences
Groups, graphs, languages, automata, games and second-order monadic logic

European Journal of Combinatorics
Computational complexity of rule distributions of non-uniform cellular automata

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
From One-dimensional to Two-dimensional Cellular Automata

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Real-time reversible iterative arrays

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Cellular automata on regular rooted trees

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Time-Symmetric machines

RC'13 Proceedings of the 5th international conference on Reversible Computation
Cellular automata between sofic tree shifts

Theoretical Computer Science
Local rule distributions, language complexity and non-uniform cellular automata

Theoretical Computer Science
m-Asynchronous cellular automata: from fairness to quasi-fairness

Natural Computing: an international journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.