A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA

This paper proposes a pipelined non-deterministic finite automaton (NFA)-based string matching scheme using field programmable gate array (FPGA) implementation. The characteristics of the NFA such as shared common prefixes and no failure transitions are considered in the proposed scheme. In the impl...

Descripción completa

Detalles Bibliográficos
Autores principales: Kim, HyunJin, Choi, Kang-Il
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2016
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5047626/
https://www.ncbi.nlm.nih.gov/pubmed/27695114
http://dx.doi.org/10.1371/journal.pone.0163535

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5047626/
https://www.ncbi.nlm.nih.gov/pubmed/27695114
http://dx.doi.org/10.1371/journal.pone.0163535

Ejemplares similares