Regular Expressions with Lookahead

Regular Expressions with Lookahead

Blog Article

This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene Bundle 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 Kits REwLA to equivalent deterministic finite automata (DFA).