New Algorithms for Regular Expression Matching

DOI10.1007/11786986_56MaRDI QIDQ3613797zbMATH OpenOpenAlexFDO

Authors Philip Bille

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_56

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Fast and compact regular expression matching
• Faster Regular Expression Matching
• A Four Russians algorithm for regular expression pattern matching
• scientific article; zbMATH DE number 1962812
• A Subquadratic Algorithm for Approximate Regular Expression Matching

Cited in

(26)

• A Boyer-Moore-style algorithm for regular expression pattern matching.
• A faster algorithm for finding shortest substring matches of a regular expression
• From regular expression matching to parsing
• Fast and compact regular expression matching
• Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA
• Regular expression matching algorithm based on parameters setting
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Disambiguation in regular expression matching via position automata with augmented transitions
• A fast bit-parallel algorithm for matching extended regular expressions
• Regular expression grouping optimization based on genetic algorithm
• scientific article; zbMATH DE number 5717242 (Why is no real title available?)
• Faster Regular Expression Matching
• A Four Russians algorithm for regular expression pattern matching
• scientific article; zbMATH DE number 1962812 (Why is no real title available?)
• String matching with variable length gaps
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Negative factor. Improving regular-expression matching in strings
• From Regular Expression Matching to Parsing
• Space-efficient representations for Glushkov automata
• An improved prefix-free regular-expression matching
• Regular expression matching with multi-strings and intervals
• Combinatorial Pattern Matching
• Text indexing for simple regular expressions
• Efficient matching of some fundamental regular expressions with backreferences
• Compact representations of automata for regular expression matching
• Matching regular expressions on uncertain data

This page was built for publication: New Algorithms for Regular Expression Matching

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