Add to ORKGWe previously proved that almost all words of length n over a finite alphabet A with m letters contain as factors all words of length k(n) over A as n # #, provided lim sup n## k(n)/ log n < 1/ log m
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
Let P be a hereditary property of words, i.e., an infinite class of finite words such that every sub...
How large must a word list be in order to have a reasonable chance of including words starting with ...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
AbstractLutz Priese raised the following conjecture: Almost all words of length n over a finite alph...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
AbstractIn this paper we consider a combinatorial method for the analysis of finite words recently i...
AbstractA set of words is factorially balanced if the set of all the factors of its words is balance...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
International audienceThis work takes another look at the number of runs that a string may contain a...
AbstractA set of words X over a finite alphabet A is said to be unavoidable if all but finitely many...
AbstractWe show by an injective proof that a word w of length k⩾2 occurs as a factor in a minimum nu...
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border do...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
Let P be a hereditary property of words, i.e., an infinite class of finite words such that every sub...
How large must a word list be in order to have a reasonable chance of including words starting with ...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
AbstractLutz Priese raised the following conjecture: Almost all words of length n over a finite alph...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
AbstractIn this paper we consider a combinatorial method for the analysis of finite words recently i...
AbstractA set of words is factorially balanced if the set of all the factors of its words is balance...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
International audienceThis work takes another look at the number of runs that a string may contain a...
AbstractA set of words X over a finite alphabet A is said to be unavoidable if all but finitely many...
AbstractWe show by an injective proof that a word w of length k⩾2 occurs as a factor in a minimum nu...
A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border do...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
Let P be a hereditary property of words, i.e., an infinite class of finite words such that every sub...
How large must a word list be in order to have a reasonable chance of including words starting with ...