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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Graz University of Technology
2021-04-01
|
| Series: | Journal of Universal Computer Science |
| Subjects: | |
| Online Access: | https://lib.jucs.org/article/66330/download/pdf/ |