SDFA: series DFA for memory-efficient regular expression matching

DOI10.1007/978-3-642-31606-7_30zbMATH Open1297.68151OpenAlexW2098436992MaRDI QIDQ2914723FDOQ2914723

Authors: Tingwen Liu, Yong Sun, Binxing Fang 

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_30

Recommendations

• Compressing regular expressions' DFA table by matrix decomposition
• scientific article; zbMATH DE number 1848391
• From regular expressions to DFA's using compressed NFA's
• Compact representations of automata for regular expression matching
• New techniques for regular expression searching

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• The complete-tree-like matching mc-DFA and their implementation
• Regular expression matching algorithm based on parameters setting
• Compact representations of automata for regular expression matching
• Title not available (Why is that?)
• Compressing regular expressions' DFA table by matrix decomposition

This page was built for publication: SDFA: series DFA for memory-efficient regular expression matching

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