An n log n algorithm for minimizing states in a finite automaton

@techreport{citeulike:2137811, address = {Stanford, CA, USA}, author = {Hopcroft, John E. }, citeulike-article-id = {2137811}, comment = {Also published at Theory of Machines and Computations: International Symposium on the Theory of Machines and Computations, 1971 http://portal.acm.org/citation.cfm?coll=GUIDE\&dl=GUIDE\&id=578829}, keywords = {algorithms, automata}, posted-at = {2007-12-17 18:32:00}, priority = {2}, publisher = {Stanford University}, title = {An n log n algorithm for minimizing states in a finite automaton}, url = {http://portal.acm.org/citation.cfm?id=891883}, year = {1971} }

TY - RPRT ID - citeulike:2137811 L3 - citeulike-article-id:2137811 TI - An n log n algorithm for minimizing states in a finite automaton AD - Stanford, CA, USA PB - Stanford University KW - algorithms KW - automata N1 - Also published at Theory of Machines and Computations: International Symposium on the Theory of Machines and Computations, 1971 http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=578829 AU - Hopcroft, John PY - 1971/// UR - http://portal.acm.org/citation.cfm?id=891883 ER -