COMPATABILITY AND ROW-COLUMN MINIMIZATION OF SEQUENTIAL MACHINE,
Abstract
The abstract framework in which reduction of a sequential machine takes place is studied. The covering and closure conditions are derived from a conceptually simple notion of compatible total states and a Boolean algebra is explored which is used to transform these conditions into mappings that produce compatible machines. An algorithm based on a product-of-sums written in this algebra is presented. An algorithm based on a distributed sum-of-products in the same algebra is developed. This second algorithm appears simpler and more appealing. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1967
- Accession Number
- AD0654030
Entities
People
- Gerald J. Lipovski
Organizations
- University of Illinois Urbana–Champaign