Accession Number:

AD0861995

Title:

The Simplification of Incompletely Specified Sequential Machines.

Descriptive Note:

Master's thesis,

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING

Personal Author(s):

Report Date:

1969-03-01

Pagination or Media Count:

89.0

Abstract:

The report is founded upon the work of Paull and Unger and Grasselli and Luccio. It uses the concept of Prime Compatibility Classes to develop a new solution method. Prime classes are collected into closed sets called Composite Classes. The resulting Composite Classes are then used to construct a new tabular display called a Set Composition table or SC table. Since the variables of the SC table are closed sets, the table is solved as a prime implicant table to yield a minimal cover. Provision is also made to transform the solution in terms of Composite Classes into a corresponding solution in terms of Prime Classes. The objectives of the study are the following Obtain a minimal solution through the use of existing methods for solving prime implicant tables Accomodate and solve problems already formulated as CC tables and Simplify procedures to permit computer solution. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE