College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||A Linear Algorithm for Testing Equivalence of Finite Automata|
|Authors: ||Hopcroft, John E.|
Karp, R. M.
|Keywords: ||computer science|
|Issue Date: ||Dec-1971|
|Publisher: ||Cornell University|
|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 automaton with the size of the input alphabet.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.