Accession Number:

AD0763449

Title:

Sequential Machine Reduction and State Assignment Using Partitions in a Lattice Algebra.

Descriptive Note:

Technical rept.,

Corporate Author:

CULLEN COLL OF ENGINEERING HOUSTON TEX

Personal Author(s):

• Morehouse,Richard A. , Jr

Report Date:

1973-05-01

Pagination or Media Count:

216.0

Abstract:

A unified theory is presented which provides a logic designer with a practical method for performing sequential machine state reduction and state assignment. The theory of using partitions in a lattice algebra is developed for these areas and algotithms are presented for practical use by either hand or computer-aided methods. The theory and algorithms are than extended to a more general type of analysis. A computer program was written to perform state reduction and state assignment on any type of sequential machine by using substitution property parititons in the unified concept presented. A problem-oriented language is included in this program to allow a designer to describe a sequential machine in a natural manner. Author

Descriptors:

• (*DIGITAL COMPUTERS
• COMPUTER LOGIC)
• (*MATHEMATICAL LOGIC
• THEOREMS)
• LOGIC CIRCUITS
• SET THEORY
• MAPPING(TRANSFORMATIONS)
• MATHEMATICAL MODELS
• COMPUTER PROGRAMMING
• THEOREMS

Subject Categories:

• Theoretical Mathematics
• Computer Programming and Software
• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE