Optimal off-line detection of repetitions in a string (Q1170893): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q64357145, #quickstatements; #temporary_batch_1711094041063
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185781 / rank
 
Normal rank

Latest revision as of 17:15, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimal off-line detection of repetitions in a string
scientific article

    Statements

    Optimal off-line detection of repetitions in a string (English)
    0 references
    1983
    0 references
    0 references
    algorithm
    0 references
    repetitions in a given textstring on a finite alphabet
    0 references
    leaf- tree
    0 references
    0 references
    0 references
    0 references
    0 references