Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/5958
Title: A Linear Algorithm for Testing Equivalence of Finite Automata
Authors: Hopcroft, John E.
Karp, R. M.
Keywords: computer science
technical report
Issue Date: Dec-1971
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR71-114
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.
URI: http://hdl.handle.net/1813/5958
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
71-114.pdf360.52 kBAdobe PDFView/Open
71-114.ps117.18 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us