Search: id:"swepub:oai:DiVA.org:umu-192863" >
Regular Expressions...
Regular Expressions with Lookahead
-
- Berglund, Martin, 1981- (author)
- Department of Information Science, Stellenbosch University, South Africa
-
- van der Merwe, Brink (author)
- Computer Science Division, Stellenbosch University, South Africa
-
- van Litsenborgh, Steyn (author)
- Computer Science Division, Stellenbosch University, South Africa
-
(creator_code:org_t)
- 2021-04-28
- 2021
- English.
-
In: Journal of universal computer science (Online). - : Pensoft Publishers. - 0948-695X .- 0948-6968. ; 27:4, s. 324-340
- Related links:
-
https://doi.org/10.3...
-
show more...
-
https://umu.diva-por... (primary) (Raw object)
-
https://lib.jucs.org...
-
https://urn.kb.se/re...
-
https://doi.org/10.3...
-
show less...
Abstract
Subject headings
Close
- 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).
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- Regular expressions
- Lookahead expressions
- Boolean automata
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database