"2008-11-16+01:00"^^ . "363052" . "26230" . "Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching"@en . "Z(MSM0021630528)" . "978-3-200-01612-5" . . . . . . . "Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching" . "As todays networks grow very fast, it is necessary
to protect networks by security systems such as firewalls and
Intrusion Detection Systems. Pattern matching is time critical
operation on multigigabit networks for current IDS. Patterns
are often described by regular expressions. The paper deals
with fast regular expression matching using the Deterministic
Finite Automata (DFA) with perfect hash function. We introduce
decomposition of the statement to the transformation of
the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table."@en . . . "V\u00EDde\u0148" . "Deterministic Finite Automata, FPGA, perfect hashing
"@en . . "2"^^ . . "2"^^ . "Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching"@en . . "Proceedings of Junior Scientist Conference 2008" . "RIV/00216305:26230/08:PU78072" . . . "[45EB158885A9]" . . "Ko\u0159enek, Jan" . "As todays networks grow very fast, it is necessary
to protect networks by security systems such as firewalls and
Intrusion Detection Systems. Pattern matching is time critical
operation on multigigabit networks for current IDS. Patterns
are often described by regular expressions. The paper deals
with fast regular expression matching using the Deterministic
Finite Automata (DFA) with perfect hash function. We introduce
decomposition of the statement to the transformation of
the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table." . "Technical University Wien" . "RIV/00216305:26230/08:PU78072!RIV10-MSM-26230___" . "Vienna" . "Ka\u0161til, Jan" . . . "2"^^ . . "Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching" .