New techniques for regular expression searching

DOI10.1007/S00453-004-1120-3zbMath1075.68578OpenAlexW2089302579MaRDI QIDQ1763149

Mathieu Raffinot, Gonzalo Navarro

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/176182

zbMATH Keywords

BDMGlushkov automatonBit-ParallelismCompact DFA representationReverse factors

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Related Items (8)

Fast and compact regular expression matching ⋮ Motif matching using gapped patterns ⋮ On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns ⋮ String matching with variable length gaps ⋮ A faster algorithm for finding shortest substring matches of a regular expression ⋮ Space-Efficient Representations for Glushkov Automata ⋮ Compact representations of automata for regular expression matching ⋮ Dictionary matching with a few gaps

This page was built for publication: New techniques for regular expression searching