Computing epsilon-free NFA from regular expressions in O(n log:::2:::(n)) time

Christian Hagenah, Anca Muscholl. Computing epsilon-free NFA from regular expressions in O(n log:::2:::(n)) time. ITA, 34(4):257-278, 2000.

Abstract

Abstract is missing.