Periods in partial words: an algorithm (Q1932359): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Combinatorics on Partial Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity, partial words, and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods in Partial Words: An Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised fine and Wilf's theorem for arbitrary number of periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorics of finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and the interaction property of periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the periodicity lemma on strings with holes / rank
 
Normal rank

Revision as of 02:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Periods in partial words: an algorithm
scientific article

    Statements

    Periods in partial words: an algorithm (English)
    0 references
    0 references
    0 references
    18 January 2013
    0 references
    automata and formal languages
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    Fine and Wilf's theorem
    0 references
    strong periods
    0 references
    graph connectivity
    0 references
    optimal lengths
    0 references

    Identifiers