On single-loop realizations of automata

This paper is concerned with the problem of realizing a finite automaton A by a sequential circuit with a single feedback loop carrying a binary signal. To find such a realization, one must find a binary total-state partition, which can be used for feedback, for the flow table T of A or for some expanded Version of T. A method is presented for testing whether a given flow table possesses a feedback partition. If one exists, the method can generate all such partitions, and the corresponding single-loop realizations are easily found. Some special techniques of finding single-loop realizations are also de scribed.