In this paper the group-theoretical concept of confluence sets is introduced as a valuable tool in the analysis of linear sequential circuits LSCs. Using this concept, a scheme is formulated for producing state graph of autonomous LSCs which, in the singular case, is superior to currently known schemes. Singular LSCs, which are of potential interest in error correction systems, are studied in detail. Properties of their state graphs are derived, culminating in a unique characterization of such graphs in terms of representative cycles and trees. Together with known results on nonsingular circuits, the results in this paper offer a description of the autonomous behavior of the general linear sequential circuit. Author
Reprinted from IEEE Transactions on Electronic Computers, Volume EC-13:226-231, no.3, Jun 64.