A Linear Algorithm for Testing Equivalence of Finite Automata.
CORNELL UNIV ITHACA N Y
Pagination or Media Count:
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
- Computer Programming and Software
- Computer Hardware