Regular Expressions with Lookahead

Regular Expressions with Lookahead

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 R...

Full description

Bibliographic Details
Main Authors: Martin Berglund, Brink van der Merwe, Steyn van Litsenborgh
Format: Article
Language:English
Published: Graz University of Technology 2021-04-01
Series:Journal of Universal Computer Science
Subjects:
Regular expressions
Lookahead expressions
Boolea
Online Access:https://lib.jucs.org/article/66330/download/pdf/
Description
Summary: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).
ISSN:0948-6968

Similar Items