Partial words and a theorem of Fine and Wilf revisited (Q5958314): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q126550511, #quickstatements; #temporary_batch_1722342728189
 
Property / Wikidata QID
 
Property / Wikidata QID: Q126550511 / rank
 
Normal rank

Latest revision as of 13:38, 30 July 2024

scientific article; zbMATH DE number 1715315
Language Label Description Also known as
English
Partial words and a theorem of Fine and Wilf revisited
scientific article; zbMATH DE number 1715315

    Statements

    Partial words and a theorem of Fine and Wilf revisited (English)
    0 references
    3 March 2002
    0 references
    A word of length \(n\) over a finite alphabet \(A\) is a map from \({0,\dots,n-1}\) into \(A.\) A partial word of length \(n\) over \(A\) is a partial map from \({0,\dots,n-1}\) into \(A.\) In the latter case, elements of \({0,\dots,n-1}\) without image are called holes (a word is just a partial word without holes). In this paper, we extend a fundamental periodicity result on words due to Fine and Wilf to partial words with two or three holes. This study was initiated by Berstel and Boasson for partial words with one hole. Partial words are motivated by molecular biology.
    0 references
    combinatorial problems
    0 references
    words
    0 references
    formal languages
    0 references

    Identifiers