| A Linear Algorithm for Testing Equivalence of Finite Automata. (2005) | |||||||||
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). Prepared in cooperation with California Univ., Berkeley, Grant NSF-GP-25081. | |||||||||
Details der Publikation | |||||||||
| |||||||||