Regular Expressions with Lookahead
Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh · JUCS - Journal of Universal Computer Science · 2021
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads . We show how to translate regular expressions with lookaheads ( REwLA ) to equivalent Boolean automata having at most 3 states more than the length of the REwLA . We also investigate the state complexity when translating REwLA to equivalent deterministic finite automata (DFA).