Counting Minimal Semi-Sturmian Words By: F. Blanchet-Sadri,
نویسنده
چکیده
This is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, 161, 18, (2013) DOI: 10.1016/j.dam.2013.07.008
منابع مشابه
On Minimal Sturmian Partial Words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by pw(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with ...
متن کاملCounting Primitive Partial Words
A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain “do not know” symbols.
متن کاملA generalization of
This paper approaches the combinatorial problem of Thue freeness for partial words. Partial words are sequences over a finite alphabet that may contain a number of ―holes‖. First, we give an infinite word over a three-letter alphabet which avoids squares of length greater than two even after we replace an infinite number of positions with holes. Then, we give an infinite word over an eight-lett...
متن کاملCounting Bordered Partial Words by Critical Positions
A partial word, sequence over a finite alphabet that may have some undefined positions or holes, is bordered if one of its proper prefixes is compatible with one of its suffixes. The number theoretical problem of enumerating all bordered full words (the ones without holes) of a fixed length n over an alphabet of a fixed size k is well known. In this paper, we investigate the number of bordered ...
متن کاملPartial words and the critical factorization theorem revisited
In this paper, we consider one of the most fundamental results on periodicity of words, namely the critical factorization theorem. Given a word w and nonempty words u, v satisfying w = uv, the minimal local period associated to the factorization (u, v) is the length of the shortest square at position |u| − 1. The critical factorization theorem shows that for any word, there is always a factoriz...
متن کامل