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. In Lubos Brim, Jozef Gruska, JirĂ­ Zlatuska, editors, Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS 98, Brno, Czech Republic, August 24-28, 1998, Proceedings. Volume 1450 of Lecture Notes in Computer Science, pages 277-285, Springer, 1998. [doi]

Abstract

Abstract is missing.