COMPUTER PROGRAMS DEALING WITH FINITE-STATE MACHINES: PART II.
MICHIGAN UNIV ANN ARBOR SYSTEMS ENGINEERING LAB
Pagination or Media Count:
A number of algorithms were programmed, dealing with finite-state machines the purposes of this effort being 1 pedagogical application, 2 the stimulation of insight, and 3 the generation of new questions and approaches. Out of a set of thirty-eight more or less different problems dealing with finite state machines, seven representatives were selected namely 1 simulate a given machine, 2 determine if a given machine is strongly connected, 3 determine the state equivalence classes and minimal form for a given machine, 4 determine the automorphisms and their group for a given machine, 5 determine a shortest simple adaptive diagnosing experiment for a given machine and admissible set, 6 determine an equivalent regular expression for a given machine, 7 exhibit the lattice of SP partitions for a given machine. This report, the second of two, describes the programs treating problems five through seven the first report treating problems one through four appeared previously as AD-657 999.
- Computer Programming and Software
- Computer Systems