Accession Number:

AD0295633

Title:

ON THE MINIMAL SET OF COMPATIBLES FOR CLOSURE

Descriptive Note:

Corporate Author:

POLYTECHNIC INST OF BROOKLYN NY MICROWAVE RESEARCH INST

Personal Author(s):

Report Date:

1962-10-01

Pagination or Media Count:

46.0

Abstract:

Given an incompletely specified sequential switching function in the form of a flow table, Paull and Unger had provided a systematic procedure for reducing the function into a set of maximum compatibles. A technique is presented here for selecting a minimal closed set of compatibles without the process of enumeration. The rules have been applied to numerous examples including those presented by Paull and Unger.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE