Finite automata and their decision problems
IBM Journal of Research and Development
A Note on the Solution of Sequential Boolean Equations
IEEE Transactions on Computers
An Approach to Unified Methodology of Combinational Switching Circuits
IEEE Transactions on Computers
Degrees of lookahead in regular infinite games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 14.99 |
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.