Accession Number:

AD0730149

Title:

Subset-Specified Sequential Machines.

Descriptive Note:

Doctoral thesis,

Corporate Author:

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

Personal Author(s):

Report Date:

1971-06-01

Pagination or Media Count:

126.0

Abstract:

In the design of sequential machines to perform specified tasks, situations sometimes arise in which the proper next-state or output entry in the flow-table is neither completely specified nor completely arbitrary. A machine having a flow-table of this type is called a subset-specified sequential machine SSSM. It is not always possible to find a minimum-state realization of a subset-specified sequential machine using existing techniques for the state-reduction of incompletely-specified machines. A state-reduction procedure is developed for SSSMs which parallels the methods of Paull and Unger and of Grasselli and Luccio, and which reduces to these methods when the SSSM being reduced is an incompletely-specified machine. SSSM flow-tables are Boolean matrices, and can be manipulated as elements of a Boolean algebra. The idea of subset-specification is applicable to the modelling of certain types of learning processes, and to the analysis of systems exhibiting variable behavior or subject to uncertain inputs. Author

Subject Categories:

  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE