Accession Number:

AD0735159

Title:

A Linear Algorithm for Testing Equivalence of Finite Automata.

Descriptive Note:

Technical rept.,

Corporate Author:

CORNELL UNIV ITHACA N Y

Personal Author(s):

Report Date:

1971-12-01

Pagination or Media Count:

11.0

Abstract:

An algorithm is given for determining if two finite automata with start states are equivalent. The asymptotic running time of the algorithm is bounded by a constant times the product of the number of states of the larger automation with the size of the input alphabet. Author

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware
  • Bionics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE