General methods are presented for analyzing the terminal behavior of the classes of one-dimensional unidirectional iterative systems with arbitrary many intercell leads and two-dimensional iterative systems with unidirectional signal flow and one intercell lead on each axis, where the cell structure is either an arbitrary linear switching circuit (combinational) or an arbitrary linear sequential machine (LSM).

An analysis of the state structure and of the autonomous behavior of iterative systems belonging to the class of one-dimensional unidirectional single-output autonomous iterative arrays with one intercell lead and the cell structure of a linear sequential machine (LSM) is presented. An algorithm is developed for computing the state structure of any such iterative system with the cell structure of a minimal LSM. Another algorithm computes the cycle structure of the output sequences generated by any such iterative system, with the cell structure of an arbitrary single-input single-output LSM.

In this paper a theory of two-dimensional moment invariants for planar geometric figures is presented. A fundamental theorem is established to relate such moment invariants to the well-known algebraic invariants. Complete systems of moment invariants under translation, similitude and orthogonal transformations are derived. Some moment invariants under general two-dimensional linear transformations are also included. Both theoretical formulation and practical models of visual pattern recognition based upon these moment invariants are discussed. A simple simulation program together with its performance are also presented. It is shown that recognition of geometrical patterns and alphabetical characters independently of position, size and orientation can be accomplished. It is also indicated that generalization is possible to include invariance with parallel projection.