A new recognition algorithm for extended regular expressions
From MaRDI portal
Recommendations
- An automata-based recognition algorithm for semi-extended regular expressions
- Fast algorithms for extended regular expression matching and searching
- An improved algorithm for the membership problem for extended regular expressions
- Efficient testing and matching of deterministic regular expressions
- A fast bit-parallel algorithm for matching extended regular expressions
Cited in
(8)- A polynomial time match test for large classes of extended regular expressions
- A fast bit-parallel algorithm for matching extended regular expressions
- A Four Russians algorithm for regular expression pattern matching
- scientific article; zbMATH DE number 980420 (Why is no real title available?)
- Fast algorithms for extended regular expression matching and searching
- An automata-based recognition algorithm for semi-extended regular expressions
- An improved algorithm for the membership problem for extended regular expressions
- An Effective Algorithm for the Membership Problem for Extended Regular Expressions
This page was built for publication: A new recognition algorithm for extended regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474094)