Faster Regular Expression Matching
From MaRDI portal
Publication:3638033
DOI10.1007/978-3-642-02927-1_16zbMath1248.68576OpenAlexW1548501023MaRDI QIDQ3638033
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_16
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Related Items (11)
Unnamed Item ⋮ Unnamed Item ⋮ String matching with variable length gaps ⋮ Space-Efficient Representations for Glushkov Automata ⋮ A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem ⋮ Fast searching in packed strings ⋮ On the size of partial derivatives and the word membership problem ⋮ Compact representations of automata for regular expression matching ⋮ From Regular Expression Matching to Parsing ⋮ From regular expression matching to parsing ⋮ Dictionary matching with a few gaps
Uses Software
This page was built for publication: Faster Regular Expression Matching
