It is proved that every regular expression of size n can be converted into an equivalent nondeterministic nite automaton (NFA) of size O(n(log n) 2) in polynomial time. The best previous conversions result in NFAs of worst case size (n 2). Moreover, the nonexistence of any linear conversion is proved: we give a language Ln described by a regular expression of size O(n) such that every NFA accepting Ln is of size (n log n).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.