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, and if a solution with a finite delay exists. In case of existence of solutions the algorithms provide them. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1968
Accession Number
AD0667537

Entities

People

  • Albert R. Meyer
  • Shimon Even

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Behavior And Behavior Mechanisms
  • Behavioral Disciplines And Activities
  • Behavioral Sciences
  • Cooperation
  • Equations
  • Mathematics
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research