@article{CHAMPARNAUD2004241,
    Author = {Champarnaud, J.-M. and Coulon, F.},
    File = {1-s2.0-S0304397504004803-main (0) - a - a - z.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Automata, NFA, Simulation, Reduction, Preorder, Nondeterministic},
    Note = {Developments in Language Theory},
    Number = {3},
    Pages = {241 - 253},
    Title = {NFA reduction algorithms by means of regular inequalities},
    URL = {http://www.sciencedirect.com/science/article/pii/S0304397504004803},
    Volume = {327},
    Year = {2004},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397504004803},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2004.02.048},
    date-added = {2017-11-02 08:18:14 +0000},
    date-modified = {2017-11-02 08:18:14 +0000},
    doi = {10.1016/j.tcs.2004.02.048}
}

@article{CHAMPARNAUD2004241, Author = {Champarnaud, J.-M. and Coulon, F.}, File = {1-s2.0-S0304397504004803-main (0) - a - a - z.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Automata, NFA, Simulation, Reduction, Preorder, Nondeterministic}, Note = {Developments in Language Theory}, Number = {3}, Pages = {241 - 253}, Title = {NFA reduction algorithms by means of regular inequalities}, URL = {http://www.sciencedirect.com/science/article/pii/S0304397504004803}, Volume = {327}, Year = {2004}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397504004803}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2004.02.048}, date-added = {2017-11-02 08:18:14 +0000}, date-modified = {2017-11-02 08:18:14 +0000}, doi = {10.1016/j.tcs.2004.02.048} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge