Repetitive perhaps, but certainly not boring (Q1583539): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subtree max gap problem with application to parallel string covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptions of the Characteristic Sequence of an Irrational / 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: Q4351065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Pattern Avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact number of squares in Fibonacci words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / 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 cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to compute all the covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beatty Sequences, Continued Fractions, and Certain Shift Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and flexible detection of contiguous repeats using a suffix tree / rank
 
Normal rank

Latest revision as of 15:55, 30 May 2024

scientific article
Language Label Description Also known as
English
Repetitive perhaps, but certainly not boring
scientific article

    Statements

    Repetitive perhaps, but certainly not boring (English)
    0 references
    0 references
    26 October 2000
    0 references
    In this paper some of the work done on repetitions in strings is surveyed, especially that of an algorithmic nature. Several open problems are described and conjectures formulated about some of them.
    0 references
    string
    0 references
    word
    0 references
    repetition
    0 references
    repeat
    0 references
    cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers