rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    non sort: A
    title: directed search algorithm for the canonical minimization of switching functions
  name:
    name part: McKinney, Melvin Howard.
    role:
      role term: creator
  name:
    name part: Noe, Philip E.
    role:
      role term: degree supervisor.
  name:
    name part: Pooch, Udo W.
    role:
      role term: degree supervisor.
  name:
    name part: Rhyne, V. Thomas
    role:
      role term: degree committee member.
  name:
    name part: Simmons, Dick B.
    role:
      role term: degree committee member.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: theses
  genre: Academic theses
  origin info:
    place:
      place term: txu
    date issued: 1974
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: print
    extent: 192 leaves
  abstract: The Directed Search Algorithm performs Iwo-level minimization of switching functions. The identification of prime implicants and the selection of a minimal cover are performed in a synergetic fashion. Purely cyclic situations are resolved by either a minimum method or an approximate method--as specified by the user. The algorithm employs an algebraic topological perspective of a switching function along with viewing the problem as one in Artificial Intelligence involving a state-space search. A search for prime implicants is only performed for minterms which must be covered, with immediate identification of essential prime implicants. If essentiality is not detected, a recursive search is employed using information gained by previous search to reduce the amount of subsequent search. A concept known as pseudo-essentiality is made possible by use of another concept known as the true form cell; these two concepts allow selection of prime implicants sooner than in other methods of switching function minimization. In addition, the true form cell concept allows removal front consideration of superfluous prime implicants. A switching function is partitioned into as many smaller independent problems as possible by use of the concept of the cyclic chain; the cyclic chain is further partitioned by the use of pseudo-essentiality. Only the prime implicants involved in a cyclic chain are considered together for cyclic resolution. The Directed Search Algorithm is implemented in the FORTRAN language.
  note: Ph. D. in Computing Science Texas A & M University
  subject:
    topic: Major computing science
  classification: QA76 .M3 1979
  identifier: http://proxy.library.tamu.edu/login
  identifier: https://hdl.handle.net/1969.1/DISSERTATIONS-175802
  related item:
    location:
      url: http://proxy.library.tamu.edu/login
  related item:
    location:
      url: https://hdl.handle.net/1969.1/DISSERTATIONS-175802
  record info:
    record content source: TXA
    record creation date: 791114
    record change date: 20220103135218.0
    record identifier: in00000153655
    language of cataloging:
      language term: eng