@article{Jiang:1993:MNP:165062.165076,
    Address = {Philadelphia, PA, USA},
    Author = {Jiang, Tao and Ravikumar, B.},
    ISSN = {0097-5397},
    Journal = {SIAM J. Comput.},
    Keywords = {Np-complete, PSPACE-complete, finite automaton, minimization},
    Month = {December},
    Number = {6},
    Pages = {1117--1141},
    Publisher = {Society for Industrial and Applied Mathematics},
    Title = {Minimal NFA Problems Are Hard},
    URL = {http://dx.doi.org/10.1137/0222067},
    Volume = {22},
    Year = {1993},
    acmid = {165076},
    bdsk-url-1 = {http://dx.doi.org/10.1137/0222067},
    date-added = {2013-12-12 18:25:33 +0000},
    date-modified = {2013-12-12 18:25:33 +0000},
    issue_date = {Dec. 1993},
    numpages = {25},
    doi = {10.1137/0222067}
}

@article{Jiang:1993:MNP:165062.165076, Address = {Philadelphia, PA, USA}, Author = {Jiang, Tao and Ravikumar, B.}, ISSN = {0097-5397}, Journal = {SIAM J. Comput.}, Keywords = {Np-complete, PSPACE-complete, finite automaton, minimization}, Month = {December}, Number = {6}, Pages = {1117--1141}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {Minimal NFA Problems Are Hard}, URL = {http://dx.doi.org/10.1137/0222067}, Volume = {22}, Year = {1993}, acmid = {165076}, bdsk-url-1 = {http://dx.doi.org/10.1137/0222067}, date-added = {2013-12-12 18:25:33 +0000}, date-modified = {2013-12-12 18:25:33 +0000}, issue_date = {Dec. 1993}, numpages = {25}, doi = {10.1137/0222067} }