Issue No.03 - March (1969 vol.18)
S. Even , IEEE
The problem of solving sequential Boolean equations is shown to be equivalent to the problem of finding whether there exists a path on a labeled graph for every sequence of labels. Algorithms are given for testing whether a solution exists, and if a solution with a finite delay exists. In case of existence of solutions the algorithms provide them.
Algorithms for solution, Boolean equations, finite delay, labeled directed graphs, paths in graphs, sequential equations.
S. Even, A.R. Meyer, "Sequential Boolean Equations", IEEE Transactions on Computers, vol.18, no. 3, pp. 230-240, March 1969, doi:10.1109/T-C.1969.222636