@article{doi:10.1142/S0129054105003418,
    Abstract = {In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of ambiguity. We say that two classes of NFA are separated if one class can be exponentially more succinct in descriptional sizes than the other. New results are given for separating DFA (deterministic finite automata) from UFA (unambiguous finite automata), UFA from MDFA (DFA with multiple initial states) and UFA from FNA (finitely ambiguous NFA). We present a family of regular languages that we conjecture to be a good candidate for separating FNA from LNA (linearly ambiguous NFA).},
    Author = {Leung, Hing},
    EPrint = {https://doi.org/10.1142/S0129054105003418},
    File = {DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY - leung2005.pdf},
    Journal = {International Journal of Foundations of Computer Science},
    Number = {05},
    Pages = {975-984},
    Title = {DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY},
    URL = {https://doi.org/10.1142/S0129054105003418},
    Volume = {16},
    Year = {2005},
    bdsk-url-1 = {https://doi.org/10.1142/S0129054105003418},
    date-added = {2021-07-07 11:37:11 +0200},
    date-modified = {2021-07-07 11:37:40 +0200},
    doi = {10.1142/S0129054105003418}
}

@article{doi:10.1142/S0129054105003418, Abstract = {In this paper, we study the tradeoffs in descriptional complexity of NFA (nondeterministic finite automata) of various amounts of ambiguity. We say that two classes of NFA are separated if one class can be exponentially more succinct in descriptional sizes than the other. New results are given for separating DFA (deterministic finite automata) from UFA (unambiguous finite automata), UFA from MDFA (DFA with multiple initial states) and UFA from FNA (finitely ambiguous NFA). We present a family of regular languages that we conjecture to be a good candidate for separating FNA from LNA (linearly ambiguous NFA).}, Author = {Leung, Hing}, EPrint = {https://doi.org/10.1142/S0129054105003418}, File = {DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY - leung2005.pdf}, Journal = {International Journal of Foundations of Computer Science}, Number = {05}, Pages = {975-984}, Title = {DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY}, URL = {https://doi.org/10.1142/S0129054105003418}, Volume = {16}, Year = {2005}, bdsk-url-1 = {https://doi.org/10.1142/S0129054105003418}, date-added = {2021-07-07 11:37:11 +0200}, date-modified = {2021-07-07 11:37:40 +0200}, doi = {10.1142/S0129054105003418} }