@article{Malcher:2004:MFA:1046130.1046139,
    Address = {Essex, UK},
    Author = {Malcher, Andreas},
    File = {Minimizing Finite Automata is Computationally Hard - Malcher (1) (0) - a - a - a.pdf},
    ISSN = {0304-3975},
    Journal = {Theor. Comput. Sci.},
    Keywords = {NP-complete, finite automata, limited nondeterminism, minimization},
    Month = {November},
    Number = {3},
    Pages = {375--390},
    Publisher = {Elsevier Science Publishers Ltd.},
    Title = {Minimizing Finite Automata is Computationally Hard},
    URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.070},
    Volume = {327},
    Year = {2004},
    acmid = {1046139},
    bdsk-url-1 = {http://dx.doi.org/10.1016/j.tcs.2004.03.070},
    date-added = {2013-12-12 18:37:25 +0000},
    date-modified = {2013-12-12 18:37:25 +0000},
    file-2 = {Minimizing Finite Automata is Computationally Hard - Malcher (0) (0) - a - a - a.pdf},
    issue_date = {2 November 2004},
    numpages = {16},
    doi = {10.1016/j.tcs.2004.03.070}
}

@article{Malcher:2004:MFA:1046130.1046139, Address = {Essex, UK}, Author = {Malcher, Andreas}, File = {Minimizing Finite Automata is Computationally Hard - Malcher (1) (0) - a - a - a.pdf}, ISSN = {0304-3975}, Journal = {Theor. Comput. Sci.}, Keywords = {NP-complete, finite automata, limited nondeterminism, minimization}, Month = {November}, Number = {3}, Pages = {375--390}, Publisher = {Elsevier Science Publishers Ltd.}, Title = {Minimizing Finite Automata is Computationally Hard}, URL = {http://dx.doi.org/10.1016/j.tcs.2004.03.070}, Volume = {327}, Year = {2004}, acmid = {1046139}, bdsk-url-1 = {http://dx.doi.org/10.1016/j.tcs.2004.03.070}, date-added = {2013-12-12 18:37:25 +0000}, date-modified = {2013-12-12 18:37:25 +0000}, file-2 = {Minimizing Finite Automata is Computationally Hard - Malcher (0) (0) - a - a - a.pdf}, issue_date = {2 November 2004}, numpages = {16}, doi = {10.1016/j.tcs.2004.03.070} }