Issue No. 04 - April (1969 vol. 18)

ISSN: 0018-9340

pp: 349-365

ABSTRACT

An n-dimensional iterative array of finite-state machines is formally introduced as a real-time tape acceptor. The computational characteristics of iterative arrays are illuminated by establishing several results concerning the sets of tapes that they recognize. Intercommunication between machines in an array is characterized by specifying a stencil for the array. The computing capability of the array is preserved even if its stencil is reduced to a simple form in which machines communicate only with their nearest neighbors. An increase of computing speed by a constant factor k is defined by encoding k-length blocks of the input tapes, which reduces the lengths of the tapes by 1/k; the time available for computation is correspondingly reduced since the computation must be real time. The computation speed of iterative arrays can be increased by any constant factor k. Two examples of one-dimensional arrays are provided. The first accepts the set of palindromes; the second accepts the set of all tapes of the form tt (for any tape t). The latter set of tapes is not a context-free language; therefore, the sets of tapes accepted by iterative arrays are not all contained in the class of context-free languages. Conversely, the class of context-free languages is not contained in the class of sets of tapes accepted by iterative arrays. The sets of tapes accepted by iterative arrays are closed under the operations: union, intersection, and complement; therefore, they form a Boolean algebra. They are not closed under the reflection or concatenation-product operations.

INDEX TERMS

Acceptor, computation, computing capability, context-free language, iterative array, n-dimensional, palindrome, real time.

CITATION

S.N. Cole, "Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines",

*IEEE Transactions on Computers*, vol. 18, no. , pp. 349-365, April 1969, doi:10.1109/T-C.1969.222663