This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://localhost/temp/predkladatel/
n12http://purl.org/net/nknouf/ns/bibtex#
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
n15https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F03%3A03088068%21RIV07-GA0-21230___/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F03%3A03088068%21RIV07-GA0-21230___
rdf:type
skos:Concept n18:Vysledek
dcterms: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 called dynamic programming. We present the method on one of the pattern matching problems as well as modifications for several other tasks. 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. Není k dispozici
dcterms:title
Dynamic Programming - NFA Simulation Není k dispozici Dynamic Programming - NFA Simulation
skos:prefLabel
Není k dispozici Dynamic Programming - NFA Simulation Dynamic Programming - NFA Simulation
skos:notation
RIV/68407700:21230/03:03088068!RIV07-GA0-21230___
n4:strany
295 ; 300
n4:aktivita
n13:P n13:Z
n4:aktivity
P(GA201/01/1433), P(GA201/02/0125), Z(MSM 212300014)
n4:dodaniDat
n9:2007
n4:domaciTvurceVysledku
n20:9170367
n4:druhVysledku
n6:D
n4:duvernostUdaju
n17:S
n4:entitaPredkladatele
n14:predkladatel
n4:idSjednocenehoVysledku
604657
n4:idVysledku
RIV/68407700:21230/03:03088068
n4:jazykVysledku
n10:eng
n4:klicovaSlova
NFA simulation; dynamic programming; finite automata; pattern matching
n4:klicoveSlovo
n8:dynamic%20programming n8:NFA%20simulation n8:finite%20automata n8:pattern%20matching
n4:kontrolniKodProRIV
[5CDF2DF4CB17]
n4:mistoKonaniAkce
Tours
n4:mistoVydani
Berlin
n4:nazevZdroje
Implementation and Application of Automata
n4:obor
n19:JC
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n7:GA201%2F02%2F0125 n7:GA201%2F01%2F1433
n4:rokUplatneniVysledku
n9:2003
n4:tvurceVysledku
Holub, Jan
n4:typAkce
n5:WRD
n4:zahajeniAkce
2002-05-03+02:00
n4:zamer
n16:MSM%20212300014
s:numberOfPages
6
n12:hasPublisher
Springer-Verlag
n15:isbn
3-540-40391-4
n22:organizacniJednotka
21230