AbstractA word w is primitive if it is not a proper power of another word, and w is unbordered if it has no prefix that is also a suffix of w. We study the number of primitive and unbordered words w with a fixed weight, that is, words for which the Parikh vector of w is a fixed vector. Moreover, we estimate the number of words that have a unique border
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoidin...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
AbstractA word w is primitive if it is not a proper power of another word, and w is unbordered if it...
peer reviewedWe investigate Abelian primitive words, which are words that are not Abelian powers. We...
AbstractPrimitive words, or strings over a finite alphabet that cannot be written as a power of anot...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X ...
AbstractWe give a short proof of a result by Weinbaum [Unique sunwords in nonperiodic words, Proc. A...
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X ...
Let be an alphabet of size n ≥ 2. Our goal in this paper is to give a complete description of primi...
AbstractA primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states o...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoidin...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
AbstractA word w is primitive if it is not a proper power of another word, and w is unbordered if it...
peer reviewedWe investigate Abelian primitive words, which are words that are not Abelian powers. We...
AbstractPrimitive words, or strings over a finite alphabet that cannot be written as a power of anot...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
Given a (finite or infinite) subset X of the free monoid A⁎ over a finite alphabet A, the rank of X ...
AbstractWe give a short proof of a result by Weinbaum [Unique sunwords in nonperiodic words, Proc. A...
Given a (finite or infinite) subset X of the free monoid A∗ over a finite alphabet A, the rank of X ...
Let be an alphabet of size n ≥ 2. Our goal in this paper is to give a complete description of primi...
AbstractA primitive word w is a Lyndon word if w is minimal among all its conjugates with respect to...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
If L is a language, the automaticity function AL(n) (resp. NL(n)) of L counts the number of states o...
Primitive word is a word that can not be represented by any repetition of shorter words. Since every...
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoidin...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
DOI
Add to ORKG