Smaller representation of compiled regular expressions
From MaRDI portal
Publication:6199884
DOI10.1007/978-3-031-40247-0_22MaRDI QIDQ6199884
Sang-Ki Ko, Sicheol Sung, Yo-Sub Han
Publication date: 28 February 2024
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust bivariate boxplots and multiple outlier detection.
- Regular expressions into finite automata
- \textit{Grail}: A C++ library for automata and expressions
- From regular expressions to DFA's using compressed NFA's
- A characterization of Thompson digraphs.
- Characterization of Glushkov automata
- Memoized regular expressions
- How to settle the ReDoS problem: back to the classical automata theory
- On the Semantics of Regular Expression Parsing in the Wild
- THE ABSTRACT THEORY OF AUTOMATA
- Compact and fast algorithms for safe regular expression search
- Smaller Representation of Finite State Automata
- Programming Techniques: Regular expression search algorithm
This page was built for publication: Smaller representation of compiled regular expressions
