A Heuristic for Constructing Smaller Automata Based on Suffix Sorting and Its Application in Network Security

Inbok LEE; Victor C. VALGENTI; Min S. KIM; Sung-il OH

doi:10.1587/transinf.2017FCL0004

IEICE Transactions on Information and Systems

Online ISSN : 1745-1361
Print ISSN : 0916-8532

Special Section on Foundations of Computer Science — Frontiers of Theoretical Computer Science —

A Heuristic for Constructing Smaller Automata Based on Suffix Sorting and Its Application in Network Security

Inbok LEE, Victor C. VALGENTI, Min S. KIM, Sung-il OH

Author information

Keywords: string algorithm, regular expression, automata, network security

JOURNAL FREE ACCESS

2018 Volume E101.D Issue 3 Pages 613-615

DOI https://doi.org/10.1587/transinf.2017FCL0004

Details

Abstract

In this paper we show a simple heuristic for constructing smaller automata for a set of regular expressions, based on suffix sorting: finding common prefixes and suffixes in regular expressions and merging them. It is an important problem in network security. We applied our approach to random and real-world regular expressions. Experimental results showed that our approach yields up to 12 times enhancement in throughput.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!