Memoized regular expressions

DOI10.1007/978-3-030-79121-6_4OpenAlexW3174503061MaRDI QIDQ2117661

Jacobie Mouton, Martin Berglund, Steyn van Litsenborgh, Brink van der Merwe

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79121-6_4

zbMATH Keywords

ambiguitymemoizationregular expression matching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

How to settle the ReDoS problem: back to the classical automata theory ⋮ Smaller representation of compiled regular expressions

Uses Software

• RegExLib

Cites Work

• On the degree of ambiguity of finite automata
• Regular expressions into finite automata
• On the semantics of atomic subgroups in practical regular expressions
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• General Algorithms for Testing the Ambiguity of Finite Automata
• Reducibility among Combinatorial Problems
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Memoized regular expressions