This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sequential Boolean Equations
March 1969 (vol. 18 no. 3)
pp. 230-240
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.
Index Terms:
Algorithms for solution, Boolean equations, finite delay, labeled directed graphs, paths in graphs, sequential equations.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.