About: Repetitions in Text and Finite Automata     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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. (cs)
  • 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. (en)
Title
  • Repetice v textu a konečné automaty (cs)
  • Repetitions in Text and Finite Automata
  • Repetitions in Text and Finite Automata (en)
skos:prefLabel
  • Repetice v textu a konečné automaty (cs)
  • Repetitions in Text and Finite Automata
  • Repetitions in Text and Finite Automata (en)
skos:notation
  • RIV/68407700:21230/04:03106845!RIV/2005/MSM/212305/N
http://linked.open.../vavai/riv/strany
  • 1 ; 46
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 212300014)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 584331
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/04:03106845
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/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 (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [E8C7B10D9202]
http://linked.open...v/mistoKonaniAkce
  • Eindhoven
http://linked.open...i/riv/mistoVydani
  • Eindhoven
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Eindhoven FASTAR Days 2004
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Melichar, Bořivoj
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 0926-4515
number of pages
http://purl.org/ne...btex#hasPublisher
  • TU Eindhoven
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software