Abstract
Nondeterministic finite automaton (NFA) cannot be directly used because of its nondeterminism. One way how to use NFA is to determinize NFA and the second way is to use one of simulation methods. This paper deals with one of the simulation method called dynamic programming. We present the method on one of the pattern matching problems as well as modifications for several other tasks. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Holub, J. (2003). Dynamic programming - NFA simulation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2608, 295–300. https://doi.org/10.1007/3-540-44977-9_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
