New Algorithms for Regular Expression Matching

DOI10.1007/11786986_56zbMath1223.68064OpenAlexW1929724078MaRDI QIDQ3613797

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)

Related Items (9)

Fast and compact regular expression matching ⋮ String matching with variable length gaps ⋮ A faster algorithm for finding shortest substring matches of a regular expression ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ Space-Efficient Representations for Glushkov Automata ⋮ Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism ⋮ Compact representations of automata for regular expression matching ⋮ From Regular Expression Matching to Parsing ⋮ From regular expression matching to parsing

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