Accession Number:

AD0657999

Title:

COMPUTER PROGRAMS DEALING WITH FINITE-STATE MACHINES: PART I.

Descriptive Note:

Technical rept.,

Corporate Author:

MICHIGAN UNIV ANN ARBOR SYSTEMS ENGINEERING LAB

Personal Author(s):

Report Date:

1967-05-01

Pagination or Media Count:

41.0

Abstract:

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 first of two, describes the programs treating problems one through four, a second report treating problems five through seven is contained in AD-658 001.

Subject Categories:

  • Computer Programming and Software
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE