AbstractLutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A with m letters contain as subwords all words of length ⌊log log n⌋ over A as n → ∞. In this note we prove that this property holds for subwords of length k(n) over A provided limn → ∞ k(n)log n = 0
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is aword over $A$ such that ev...
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
We previously proved that almost all words of length n over a finite alphabet A with m letters cont...
Abstract: The problem of reconstructing words from its subwords is is due to Schützenberger and Sim...
AbstractLet Q be an alphabet on q letters. Let W : Z ≥0 → Q be a word such that each letter of Q occ...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
<p>Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exis...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
We prove that the minimal length of a word S n having the property that it contains exactly Fm+2 dis...
Let P be a hereditary property of words, i.e., an infinite class of finite words such that every sub...
AbstractWe study words on a finite alphabet avoiding a finite collection of patterns. Given a patter...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is aword over $A$ such that ev...
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
We previously proved that almost all words of length n over a finite alphabet A with m letters cont...
Abstract: The problem of reconstructing words from its subwords is is due to Schützenberger and Sim...
AbstractLet Q be an alphabet on q letters. Let W : Z ≥0 → Q be a word such that each letter of Q occ...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
<p>Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exis...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
We prove that the minimal length of a word S n having the property that it contains exactly Fm+2 dis...
Let P be a hereditary property of words, i.e., an infinite class of finite words such that every sub...
AbstractWe study words on a finite alphabet avoiding a finite collection of patterns. Given a patter...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is aword over $A$ such that ev...
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
DOI
Add to ORKG