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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n12http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F12%3A00194127%21RIV13-MSM-21240___/
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#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F12%3A00194127%21RIV13-MSM-21240___
rdf:type
n13:Vysledek skos:Concept
dcterms:description
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables). We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
dcterms:title
The Finite Automata Approaches in Stringology The Finite Automata Approaches in Stringology
skos:prefLabel
The Finite Automata Approaches in Stringology The Finite Automata Approaches in Stringology
skos:notation
RIV/68407700:21240/12:00194127!RIV13-MSM-21240___
n13:predkladatel
n19:orjk%3A21240
n4:aktivita
n18:I n18:P
n4:aktivity
I, P(GA201/09/0807)
n4:cisloPeriodika
3
n4:dodaniDat
n5:2013
n4:domaciTvurceVysledku
n14:9170367
n4:druhVysledku
n17:J
n4:duvernostUdaju
n8:S
n4:entitaPredkladatele
n16:predkladatel
n4:idSjednocenehoVysledku
136602
n4:idVysledku
RIV/68407700:21240/12:00194127
n4:jazykVysledku
n15:eng
n4:klicovaSlova
exact pattern matching; approximate pattern matching; finite automata; dynamic programming; bitwise parallelism; suffix automaton; border array; degenerate symbol
n4:klicoveSlovo
n6:finite%20automata n6:suffix%20automaton n6:bitwise%20parallelism n6:border%20array n6:degenerate%20symbol n6:dynamic%20programming n6:exact%20pattern%20matching n6:approximate%20pattern%20matching
n4:kodStatuVydavatele
CZ - Česká republika
n4:kontrolniKodProRIV
[A7E5F6A6988C]
n4:nazevZdroje
Kybernetika
n4:obor
n7:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n11:GA201%2F09%2F0807
n4:rokUplatneniVysledku
n5:2012
n4:svazekPeriodika
48
n4:tvurceVysledku
Holub, Jan
n4:wos
000307856900004
s:issn
0023-5954
s:numberOfPages
16
n12:organizacniJednotka
21240