. . "1 ; 46" . . "0926-4515" . "Melichar, Bo\u0159ivoj" . "RIV/68407700:21230/04:03106845!RIV/2005/MSM/212305/N" . . . . . . . "Repetitions in Text and Finite Automata" . . . "Repetitions in Text and Finite Automata" . . "46"^^ . "Repetitions in Text and Finite Automata"@en . "RIV/68407700:21230/04:03106845" . "Repetice v textu a kone\u010Dn\u00E9 automaty"@cs . "Proceedings of the Eindhoven FASTAR Days 2004" . "TU Eindhoven" . "2004-09-03+02:00"^^ . "Repetice v textu a kone\u010Dn\u00E9 automaty"@cs . "[E8C7B10D9202]" . "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 . . "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\u00B4t care symbols"@en . . "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\u00E1na obecn\u00E1 metoda nalezen\u00ED opakuj\u00EDc\u00EDch se pod\u0159et\u011Bzc\u016F v dan\u00E9m textu. Nejd\u0159\u00EDve je uvedena klasifikace repetic. D\u00E1le je uveden obecn\u00FD model nalezen\u00ED p\u0159esn\u00FDch repetic v jednom a v\u00EDce textech. Je uk\u00E1z\u00E1no, \u017Ee d-mno\u017Einy vznikl\u00E9 p\u0159i determinizaci nedeterministick\u00E9ho faktorov\u00E9ho automatu obsahuj\u00ED v\u0161echny informace, kter\u00E9 se t\u00FDkaj\u00ED repetic pod\u0159et\u011Bzc\u016F. Princip anal\u00FDzy t\u011Bchto d-mno\u017Ein je potom pou\u017Eit pro nalezen\u00ED p\u0159ibli\u017En\u00FDch repetic pro n\u011Bkolik definic vzd\u00E1lenost\u00ED \u0159et\u011Bzc\u016F pro obecn\u00E9 i uspo\u0159\u00E1dan\u00E9 abecedy. Je uveden i p\u0159\u00EDpad tzv. don\u00B4t care symbol\u016F. Slo\u017Eitost nalezen\u00ED repetic je uk\u00E1z\u00E1na pro p\u0159\u00EDpad repetic v jednom textu."@cs . "Z(MSM 212300014)" . "1"^^ . "21230" . "584331" . . "Repetitions in Text and Finite Automata"@en . . . . . "Eindhoven" . "1"^^ . "Eindhoven" .