Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.

Christian Hagenah Anca Muscholl Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time. 277-285 1998 conf/mfcs/1998 MFCS http://dx.doi.org/10.1007/BFb0055777 db/conf/mfcs/mfcs98.html#HagenahM98