Two-pattern strings. I: A recognition algorithm (Q1827270): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for nonhomogeneous spectra of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in Sturmian strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the squares in a Fibonacci string / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank

Latest revision as of 18:54, 6 June 2024

scientific article
Language Label Description Also known as
English
Two-pattern strings. I: A recognition algorithm
scientific article

    Statements

    Two-pattern strings. I: A recognition algorithm (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    String
    0 references
    Recognition algorithm
    0 references
    Two-pattern
    0 references
    Sturmian
    0 references
    Linear
    0 references