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.

Authors

Christian Hagenah

This author has not been identified. Look up 'Christian Hagenah' in Google

Anca Muscholl

This author has not been identified. Look up 'Anca Muscholl' in Google