Published April 28, 2021
| Version v1
Journal article
Open
Regular Expressions with Lookahead
Authors/Creators
- 1. Stellenbosch University, Stellenbosch, South Africa
Description
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).
Files
jucs_article_66330.pdf
Files
(335.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:019412cc3ce90c0c63def13945f2faae
|
335.3 kB | Preview Download |
System files
(5.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:62016f7c8a8945568cc629c5cd1c1bc7
|
5.5 kB | Download |