A Linear Algorithm for Testing Equivalence of Finite Automata

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/5958
Collections
Metadata
Show full item record
Author
Hopcroft, John E.; Karp, R. M.
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.
Date Issued
1971-12
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR71-114
Type
Technical Report

Statistics