Efficient Submatch Extraction for Practical Regular Expressions

DOI10.1007/978-3-642-37064-9_29MaRDI QIDQ4910471zbMATH OpenOpenAlexFDO

Authors Stuart Haber, William Horne, Pratyusa Manadhata, Miranda Mowbray, Prasad M. S. V. Rao

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• Fast and compact regular expression matching
• A faster algorithm for finding shortest substring matches of a regular expression
• A Subquadratic Algorithm for Approximate Regular Expression Matching
• scientific article; zbMATH DE number 1962812
• scientific article; zbMATH DE number 140453
• Approximate matching of regular expressions
• Efficient enumeration of regular expressions for faster regular expression synthesis
• Faster Regular Expression Matching
• A fast bit-parallel algorithm for matching extended regular expressions
• Fast practical multi-pattern matching

Cited in

(3)

• A deterministic parsing algorithm for ambiguous regular expressions
• scientific article; zbMATH DE number 140453 (Why is no real title available?)
• A Subquadratic Algorithm for Approximate Regular Expression Matching

Describes a project that uses

Uses Software

• RE2

This page was built for publication: Efficient Submatch Extraction for Practical Regular Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910471)