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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A possible code in the genetic code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splicing semigroups of dominoes and DNA / 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: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the syntactic structure of protein sequences and the concept of grammar complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 23:22, 3 June 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
    0 references
    combinatorial problems
    0 references
    words
    0 references
    formal languages
    0 references