This paper addresses the problem of designing regularly structured sequential circuits from uniform components. This is certainly one of the major problems a circuit designer has to face; it is even more so, as circuit sizes have become close to unmanageable with classical tools. Thus, the points which this paper emphasizes would deserve in-depth research. Unfortunately, the paper falls short of this goal.

The proposal of this paper is to employ the classical automaton decomposition theory--that of sequential decomposition, in particular--in order to obtain realizations of circuits by regularly connected uniform components. The limitations of this approach are obvious from classical automaton theoretic results--none of which the author mentions. Thus, one relevant concern would be to determine a class of practically important sequential functions which would benefit from this approach. This concern is not addressed in the paper at all.

In regard to the actual contents, the major part of the paper consists of an example phrased as Theorems 3 and 3′ (the remaining theorems are either quotations or otherwise known). In the example itself, the author explains at length how to decompose an up-down counter which is typical of an undergraduate assignment. If he makes a point at all, he certainly doesn’t say what it is.