A 1/(1-1/k)-optimal algorithm for regular expression grouping

DOI10.3724/SP.J.1001.2012.04098MaRDI QIDQ4926388zbMATH OpenOpenAlexFDO

Authors

Publication date 20 June 2013

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2012.04098

zbMATH Keywords

regular expressiondeep packet inspectiongrouping algorithm\(1/(1-1/k)\)-approximationlocal searching

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Regular expression grouping optimization based on genetic algorithm
• A constructing method of regular expression's smaller \(\varepsilon\)-NFA
• State elimination ordering strategies: some experimental results
• State elimination heuristics for short regular expressions
• Regular expression matching algorithm based on parameters setting

Cited in

(1)

• Regular expression grouping optimization based on genetic algorithm

This page was built for publication: A \(1/(1-1/k)\)-optimal algorithm for regular expression grouping

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