ON THE MINIMAL SET OF COMPATIBLES FOR CLOSURE

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1962
Accession Number
AD0295633

Entities

People

  • William C. Mow

Organizations

  • New York University Tandon School of Engineering

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Couplings
  • Electrical Engineering
  • Elimination
  • Engineering
  • Inspection
  • Materials
  • Military Research
  • New Mexico
  • North Carolina
  • Nuclear Energy
  • Plastic Explosives
  • Procurement
  • Scientific Research
  • Switching

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.