A unifying framework for the theory of iterative arrays of machines

Authors:
Serafino Amoroso;Edward Lieblein;Hisao Yamada
Affiliations:
U.S. Army Electronics Command, Fort Mnmouth, New Jersey and Stevens Institute of Technology, Hoboken, New Jersey;U.S. Army Electronics Command, Fort Mnmouth, New Jersey;The Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, Pennsylvania
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 5
Cited 3

Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
Propagation, computation, and construction in two-dimensional cellular spaces

Propagation, computation, and construction in two-dimensional cellular spaces
A representation technique for systems of interacting algorithms

A representation technique for systems of interacting algorithms
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

R70-11 Representation of Events in the von Neumann Cellular Model

IEEE Transactions on Computers
A completeness problem for pattern generation in tessellation automata

Journal of Computer and System Sciences
Tessellation structures for reproduction of arbitrary patterns

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mathematical framework is defined in which many questions concerning uniform arrays of finite-state machines can be formulated and studied. An outline is then presented that informally describes some research areas that have been under investigation. Some of the results uncovered to date are described and many open problems are stated.