Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares in partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in strings: algorithms and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-preserving indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Squares in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting powers and periods in a word from its runs structure / 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: How many double squares can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian powers and repetitions in Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words with the Maximum Number of Abelian Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many squares can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in between words and abelian words: \(k\)-abelian avoidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of squares in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on arithmetic projections, and applications to the Kakeya conjecture / 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: Order-preserving matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic-Time Algorithms for Abelian Stringology Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for consecutive permutation pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the context-freeness of the set of words containing overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718200 / rank
 
Normal rank

Latest revision as of 13:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Maximum number of distinct and nonequivalent nonstandard squares in a word
scientific article

    Statements

    Maximum number of distinct and nonequivalent nonstandard squares in a word (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2016
    0 references
    abelian squares
    0 references
    parameterized squares
    0 references
    order-preserving squares
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers