SEQUENTIAL BOOLEAN EQUATIONS.
Abstract
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. In case of existence of solutions the algorithms provide them. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1968
- Accession Number
- AD0668771
Entities
People
- Albert R. Meyer
- Shimon Even
Organizations
- Syracuse University