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...

Celý popis

Podrobná bibliografia

Vydané v:	Microprocessors and microsystems Ročník 39; číslo 2; s. 122 - 134
Hlavní autori:	Chen, Chien-Chi, Wang, Sheng-De
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.03.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!