An Algorithm for Solving the Sequential Machine Identification Program

Abstract

Given an unknown sequential machine, the machine identification problem requires that a state table be found for the sequential circuit. An algorithm for handling the machine's identification problem when the machine is strongly connected, is described along with corresponding computer programs. The algorithm proceeds by first determining a lower bound on the number of states. Then an input sequence is applied in such a way as to fill the state table entries. If a contradiction occurs, the table is expanded and the procedure continues. Otherwise, a fault detection experiment is performed to determine if the derived state table corresponds to the unknown machine. A number of examples are given.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1973
Accession Number
AD0773774

Entities

People

  • Larry A. Litteral

Organizations

  • Ohio State University

Tags

Communities of Interest

  • Advanced Electronics

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Artificial Intelligence
  • Automata Theory
  • Classification
  • Computer Programming
  • Computer Programs
  • Computers
  • Detection
  • Electrical Engineering
  • Engineering
  • Errors
  • Identification
  • Instructions
  • Machines
  • New York
  • Notation
  • Personality
  • Scientific Research
  • Security
  • Universities

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Business Analytics