New techniques for regular expression searching
From MaRDI portal
(Redirected from New techniques for regular expression searching)
Recommendations
Cited in
(17)- A faster algorithm for finding shortest substring matches of a regular expression
- Dictionary matching with a few gaps
- Fast and compact regular expression matching
- SDFA: series DFA for memory-efficient regular expression matching
- Faster Regular Expression Matching
- Motif matching using gapped patterns
- Efficient text searching of regular expressions
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- Fast text searching for regular expressions or automaton searching on tries
- String matching with variable length gaps
- Compact DFA representation for fast regular expression search
- Compact and fast algorithms for safe regular expression search
- Negative factor. Improving regular-expression matching in strings
- Algorithms and Computation
- Two-pass greedy regular expression parsing
- Space-efficient representations for Glushkov automata
- Compact representations of automata for regular expression matching
This page was built for publication: New techniques for regular expression searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763149)