Sequential Machine Reduction and State Assignment Using Partitions in a Lattice Algebra.
CULLEN COLL OF ENGINEERING HOUSTON TEX
Pagination or Media Count:
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
- Theoretical Mathematics
- Computer Programming and Software
- Computer Hardware