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

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

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n13http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
n10https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F06%3A03120236%21RIV07-GA0-21230___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n21http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A03120236%21RIV07-GA0-21230___
rdf:type
skos:Concept n9:Vysledek
dcterms:description
Není k dispozici We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively. We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.
dcterms:title
A New Approach to Determinisation Using Bit-Parallelism Není k dispozici A New Approach to Determinisation Using Bit-Parallelism
skos:prefLabel
A New Approach to Determinisation Using Bit-Parallelism Není k dispozici A New Approach to Determinisation Using Bit-Parallelism
skos:notation
RIV/68407700:21230/06:03120236!RIV07-GA0-21230___
n3:strany
228 ; 241
n3:aktivita
n4:P n4:Z n4:S
n3:aktivity
P(GA201/06/1039), S, Z(MSM6840770014)
n3:dodaniDat
n21:2007
n3:domaciTvurceVysledku
n5:3764818 n5:6420443
n3:druhVysledku
n20:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
463622
n3:idVysledku
RIV/68407700:21230/06:03120236
n3:jazykVysledku
n18:eng
n3:klicovaSlova
approximate matching; bit-parallelism; determinisation; finite automata; pattern matching
n3:klicoveSlovo
n7:approximate%20matching n7:finite%20automata n7:determinisation n7:pattern%20matching n7:bit-parallelism
n3:kontrolniKodProRIV
[B9F56B7C2FF7]
n3:mistoKonaniAkce
Tunis
n3:mistoVydani
Heidelberg
n3:nazevZdroje
Lecture Notes in Computer Science 4281, Theoretical Aspects of Computing - ICTAC 2006
n3:obor
n12:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n15:GA201%2F06%2F1039
n3:rokUplatneniVysledku
n21:2006
n3:tvurceVysledku
Šupol, Jan Melichar, Booivoj
n3:typAkce
n17:WRD
n3:zahajeniAkce
2006-11-22+01:00
n3:zamer
n14:MSM6840770014
s:numberOfPages
14
n13:hasPublisher
Springer-Verlag
n10:isbn
3-540-48815-4
n19:organizacniJednotka
21230