Compact DFA representation for fast regular expression search

DOI10.1007/3-540-44688-5_1MaRDI QIDQ4785570zbMATH OpenFDO

Authors Mathieu Raffinot, Gonzalo Navarro

Publication date 5 January 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2141/21410001

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• New techniques for regular expression searching
• Compact representations of automata for regular expression matching
• SDFA: series DFA for memory-efficient regular expression matching
• From regular expressions to DFA's using compressed NFA's
• scientific article; zbMATH DE number 5717242

Cited in

(10)

• New techniques for regular expression searching
• Regular expression searching on compressed text
• NR-grep: A fast and flexible pattern-matching tool
• SDFA: series DFA for memory-efficient regular expression matching
• Compressing regular expressions' DFA table by matrix decomposition
• Compact and fast algorithms for safe regular expression search
• Space-efficient representations for Glushkov automata
• Adaptive DFA based on array of sets
• Left is Better Than Right for Reducing Nondeterminism of NFAs
• Compact representations of automata for regular expression matching

This page was built for publication: Compact DFA representation for fast regular expression search

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