Minimization of Incompletely Specified Sequential Machines.
Abstract
The problem of state minimization of incompletely specified sequential machines has been the subject of much investigation in recent years. A large number of methods have been presented in the literature, and each method has had some improvements suggested at one time or another. However, most methods do not lend themselves to incorporation into a computer program, and hence are not directly applicable to the practical problem of reducing larger flow tables. It is the purpose of the paper to present modifications to several methods that will lead to an algorithm that is easily implemented into an efficient computer program. The primary consideration will be a simple means of storing the information, a minimal amount of memory required, and a minimal amount of computer time used.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1973
- Accession Number
- AD0766747
Entities
People
- William Jay Ooms
Organizations
- University of Illinois Urbana–Champaign