A hybrid multiple-character transition finite-automaton for string matching engine

[Display omitted] •A hybrid finite automaton is proposed with deterministic and nondeterministic parts.•The hybrid FA is capable of inspecting multiple characters in parallel.•The space required by the finite automata is efficient when scales up.•The transitions number increases almost linearly to t...

Full description

Bibliographic Details

Published in:	Microprocessors and microsystems Vol. 39; no. 2; pp. 122 - 134
Main Authors:	Chen, Chien-Chi, Wang, Sheng-De
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2015
Subjects:	Aho-Corasick algorithm Architecture Clocks Configurable Deterministic and nondeterministic finite automaton Engines Mathematical analysis Microprocessors Network intrusion detection system Pipelines String matching Aho-Corasick algorithm Deterministic and nondeterministic finite automaton Network intrusion detection system String matching
ISSN:	0141-9331, 1872-9436
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!