Fast algorithms for extended regular expression matching and searching
From MaRDI portal
Recommendations
Cited in
(20)- Synchronized regular expressions
- A Boyer-Moore-style algorithm for regular expression pattern matching.
- NR-grep: A fast and flexible pattern-matching tool
- Symbolic solving of extended regular expression inequalities
- A polynomial time match test for large classes of extended regular expressions
- A fast bit-parallel algorithm for matching extended regular expressions
- scientific article; zbMATH DE number 5717242 (Why is no real title available?)
- New Algorithms for Regular Expression Matching
- Faster Regular Expression Matching
- Extended regular expressions: succinctness and decidability
- Efficient text searching of regular expressions
- A Four Russians algorithm for regular expression pattern matching
- scientific article; zbMATH DE number 2080996 (Why is no real title available?)
- An automata-based recognition algorithm for semi-extended regular expressions
- An improved algorithm for the membership problem for extended regular expressions
- A Subquadratic Algorithm for Approximate Regular Expression Matching
- Efficient Submatch Extraction for Practical Regular Expressions
- Regular expression matching with multi-strings and intervals
- An Effective Algorithm for the Membership Problem for Extended Regular Expressions
- Incremental algorithms for solving regular expression intersection non-emptiness
This page was built for publication: Fast algorithms for extended regular expression matching and searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418648)