Can I read An Efficient Multicharacter Transition String-matching Engine Based on the Aho-corasick Algorithm on EtoBox?

An Efficient Multicharacter Transition String-matching Engine Based on the Aho-corasick Algorithm by Chien-Chi Chen; Sheng-De Wang is a Computer Science article available to read on EtoBox.

What is An Efficient Multicharacter Transition String-matching Engine Based on the Aho-corasick Algorithm about?

A string-matching engine capable of inspecting multiple characters in parallel can multiply the throughput. However, the space required for implementing a matching engine that can process multiple characters in parallel generally grows exponentially with respect to the characters to be processed in parallel. Based on the Aho-Corasick algorithm (AC-algorithm), this work presents a novel multicharacter transition Nondeterministic Finite Automaton (NFA) approach, called __multicharacter AC-NFA__ , to allow for the inspection of multiple characters in parallel. This approach first converts an AC-trie to an AC-NFA by allowing for the simultaneous activation of multiple states and then converts the AC-NFA to a __k__ -character AC-NFA by an algorithm with concatenation operations and assistant transitions. Additionally, the alignment problem, which occurs while multiple characters are being inspected in parallel, is solved using assistant transitions. Moreover, a corresponding output is provided for each inspected character by introducing priority multiplexers to determine the final matching outputs during implementation of the multicharacter AC-NFA. Consequently, the number of derived __

Who reads An Efficient Multicharacter Transition String-matching Engine Based on the Aho-corasick Algorithm?

Author

Chien-Chi Chen; Sheng-De Wang

Publisher

ACM

Published

2013

Language

EN

Field

Computer Science (Physical Sciences)