OPTIMIZING THE ASSIGNMENT PROBLEM IN THE SYNTHESIS OF SEQUENTIAL MACHINES.

Abstract

A procedure for assigning binary codes to the inputs of a sequential machine is examined in an attempt to mechanize the procedure using linear programming. Reasons are given for the difficulty involved in attempting to derive linear constraining equations for an objective function specified by the procedure. In the second part of this thesis, the partition-pair on the set of states of a sequential machine is extended to the inputs of a sequential machine in an effort to simplify the logical equations. It is shown that input-state pairs are effective in obtaining the simplification of these logical equations. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1964
Accession Number
AD0610771

Entities

People

  • Jesse W. Halsey

Organizations

  • Air Force Institute of Technology

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Equations
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research