Smaller representation of compiled regular expressions

DOI10.1007/978-3-031-40247-0_22MaRDI QIDQ6199884zbMATH OpenFDO

Authors Sicheol Sung, Sang-Ki Ko, Yo-Sub Han

Publication date 28 February 2024

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-40247-0_22

zbMATH Keywords

bit-packing schemeposition automataregex engineregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• \textit{Grail}: A C++ library for automata and expressions
• A characterization of Thompson digraphs.
• An introduction to formal languages and automata.
• Characterization of Glushkov automata
• Compact and fast algorithms for safe regular expression search
• From regular expressions to DFA's using compressed NFA's
• How to settle the ReDoS problem: back to the classical automata theory
• scientific article; zbMATH DE number 1775629 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Memoized regular expressions
• On the semantics of regular expression parsing in the wild
• Programming Techniques: Regular expression search algorithm
• Regular expressions into finite automata
• Robust bivariate boxplots and multiple outlier detection.
• Smaller representation of finite state automata
• THE ABSTRACT THEORY OF AUTOMATA

This page was built for publication: Smaller representation of compiled regular expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199884)