Accession Number:

AD0654030

Title:

COMPATABILITY AND ROW-COLUMN MINIMIZATION OF SEQUENTIAL MACHINE,

Descriptive Note:

Corporate Author:

ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB

Personal Author(s):

Report Date:

1967-05-01

Pagination or Media Count:

102.0

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

Subject Categories:

  • Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE