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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F04%3A03106845%21RIV%2F2005%2FMSM%2F212305%2FN
rdf:type
n10:Vysledek skos:Concept
dcterms:description
A general way to find repetitions of factors in a given text is shown. We start with a classification of repetitions. The general models for finding exact repetitions in one string and in a finite set of strings are introduced. It is shown that d-subsets created during determinization of nondeterministic factor automata contain all information concerning repetitions of factors. The principle of the analysis of d-subsets is then used for finding approximate repetitions using several distances for a general finite alphabet and for an ordered alphabet including the case of presence of don't care symbols. Complexity of finding repetitions is shown for exact repetitions in one string. A general way to find repetitions of factors in a given text is shown. We start with a classification of repetitions. The general models for finding exact repetitions in one string and in a finite set of strings are introduced. It is shown that d-subsets created during determinization of nondeterministic factor automata contain all information concerning repetitions of factors. The principle of the analysis of d-subsets is then used for finding approximate repetitions using several distances for a general finite alphabet and for an ordered alphabet including the case of presence of don't care symbols. Complexity of finding repetitions is shown for exact repetitions in one string. Je popsána obecná metoda nalezení opakujících se podřetězců v daném textu. Nejdříve je uvedena klasifikace repetic. Dále je uveden obecný model nalezení přesných repetic v jednom a více textech. Je ukázáno, že d-množiny vzniklé při determinizaci nedeterministického faktorového automatu obsahují všechny informace, které se týkají repetic podřetězců. Princip analýzy těchto d-množin je potom použit pro nalezení přibližných repetic pro několik definic vzdáleností řetězců pro obecné i uspořádané abecedy. Je uveden i případ tzv. don´t care symbolů. Složitost nalezení repetic je ukázána pro případ repetic v jednom textu.
dcterms:title
Repetitions in Text and Finite Automata Repetice v textu a konečné automaty Repetitions in Text and Finite Automata
skos:prefLabel
Repetitions in Text and Finite Automata Repetitions in Text and Finite Automata Repetice v textu a konečné automaty
skos:notation
RIV/68407700:21230/04:03106845!RIV/2005/MSM/212305/N
n3:strany
1 ; 46
n3:aktivita
n18:Z
n3:aktivity
Z(MSM 212300014)
n3:dodaniDat
n11:2005
n3:domaciTvurceVysledku
n4:3764818
n3:druhVysledku
n15:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
584331
n3:idVysledku
RIV/68407700:21230/04:03106845
n3:jazykVysledku
n14:eng
n3:klicovaSlova
approximate repetitions; complexity of computation of repetitions; exact repetitions in one text or in a finite set of texts; finite automata; repetitions of substrings in text; repetitions with don´t care symbols
n3:klicoveSlovo
n6:exact%20repetitions%20in%20one%20text%20or%20in%20a%20finite%20set%20of%20texts n6:finite%20automata n6:complexity%20of%20computation%20of%20repetitions n6:approximate%20repetitions n6:repetitions%20of%20substrings%20in%20text n6:repetitions%20with%20don%C2%B4t%20care%20symbols
n3:kontrolniKodProRIV
[E8C7B10D9202]
n3:mistoKonaniAkce
Eindhoven
n3:mistoVydani
Eindhoven
n3:nazevZdroje
Proceedings of the Eindhoven FASTAR Days 2004
n3:obor
n5:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n11:2004
n3:tvurceVysledku
Melichar, Bořivoj
n3:typAkce
n20:WRD
n3:zahajeniAkce
2004-09-03+02:00
n3:zamer
n9:MSM%20212300014
s:issn
0926-4515
s:numberOfPages
46
n16:hasPublisher
TU Eindhoven
n17:organizacniJednotka
21230