An Algorithm for Solving the Sequential Machine Identification Program.
OHIO STATE UNIV COLUMBUS DEPT OF ELECTRICAL ENGINEERING
Pagination or Media Count:
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 machines 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. Author
- Computer Programming and Software