• DocumentCode
    1101965
  • Title

    Sequential Boolean Equations

  • Author

    Even, Shimon ; Meyer, Albert R.

  • Author_Institution
    IEEE
  • Issue
    3
  • fYear
    1969
  • fDate
    3/1/1969 12:00:00 AM
  • Firstpage
    230
  • Lastpage
    240
  • 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, and if a solution with a finite delay exists. In case of existence of solutions the algorithms provide them.
  • Keywords
    Algorithms for solution, Boolean equations, finite delay, labeled directed graphs, paths in graphs, sequential equations.; Computer science; Delay; Equations; Laboratories; Military computing; Testing; Transforms; Writing; Algorithms for solution, Boolean equations, finite delay, labeled directed graphs, paths in graphs, sequential equations.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1969.222636
  • Filename
    1671229
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1101965