Author:
Berglund Martin,van der Merwe Brink,van Litsenborgh Steyn
Abstract
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
General Computer Science,Theoretical Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear Matching of JavaScript Regular Expressions;Proceedings of the ACM on Programming Languages;2024-06-20
2. Efficient Matching of Regular Expressions with Lookaround Assertions;Proceedings of the ACM on Programming Languages;2024-01-05
3. Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping;Lecture Notes in Computer Science;2024
4. Deducing Matching Strings for Real-World Regular Expressions;Dependable Software Engineering. Theories, Tools, and Applications;2023-12-15
5. Black Ostrich: Web Application Scanning with String Solvers;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15