Dynamic Programming - NFA Simulation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03088068" target="_blank" >RIV/68407700:21230/03:03088068 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Dynamic Programming - NFA Simulation
Original language description
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 calleddynamic programming. We present the method on one of the pattern matching problems as well as modifications for several other tasks.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Implementation and Application of Automata
ISBN
3-540-40391-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
295-300
Publisher name
Springer
Place of publication
Berlin
Event location
Tours
Event date
May 3, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—