Sciweavers

206 search results - page 8 / 42
» Regular Expressions into Finite Automata
Sort
View
WIA
2004
Springer
14 years 1 months ago
The Generalization of Generalized Automata: Expression Automata
Abstract. We explore expression automata with respect to determinism, minimization and primeness. We define determinism of expression automata using prefix-freeness. This approac...
Yo-Sub Han, Derick Wood
TON
2012
11 years 11 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
ACL
1997
13 years 9 months ago
Compiling Regular Formalisms with Rule Features into Finite-State Automata
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
George Anton Kiraz
IISWC
2008
IEEE
14 years 2 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
ANCS
2007
ACM
14 years 13 days ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley