"Dynamic Programming - NFA Simulation" . "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."@en . . . . . . . "NFA simulation; dynamic programming; finite automata; pattern matching"@en . "Nen\u00ED k dispozici"@cs . "1"^^ . "1"^^ . "Springer-Verlag" . "RIV/68407700:21230/03:03088068!RIV07-GA0-21230___" . . "P(GA201/01/1433), P(GA201/02/0125), Z(MSM 212300014)" . . . "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." . . "[5CDF2DF4CB17]" . "2002-05-03+02:00"^^ . "RIV/68407700:21230/03:03088068" . . "Tours" . "Berlin" . "3-540-40391-4" . "Nen\u00ED k dispozici"@cs . "Dynamic Programming - NFA Simulation"@en . "Dynamic Programming - NFA Simulation" . "Dynamic Programming - NFA Simulation"@en . . . "295 ; 300" . . "Implementation and Application of Automata" . . . . "Holub, Jan" . . "604657" . . "6"^^ . . "21230" . "Nen\u00ED k dispozici"@cs .