AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some nonempty words λ and ρ. For an arbitrary (possibly infinite) sequence α the expression # α denotes the (possibly infinite) supremum of the set of all |β| for β an unbordered finite segment of α
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
We shall give an introduction to the problem area concerning the well known Duval’s conjecture, whic...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Abstract. We prove a long standing conjecture of Duval in the special case of Sturmian words. Mathem...
A finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for some no...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
AbstractWe obtain new results on minimum lengths of words in an unavoidable set of words of cardinal...
AbstractWe consider repetitions in words and solve a longstanding open problem about the relation be...
AbstractAn unbordered word is a string over a finite alphabet such that none of its proper prefixes ...
AbstractAnswering an open problem in papers by Marcus and Pǎun (1994), we give here two examples of ...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
We investigate the behavior of the periods and border lengths of random words over a fixed alphabet....
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
We shall give an introduction to the problem area concerning the well known Duval’s conjecture, whic...
AbstractA nonempty word β is said to be a border of a word α if and only if α = λβ = βρ for some non...
Abstract. The relationship between the length of a word and the maximum length of its unbordered fac...
Abstract. We prove a long standing conjecture of Duval in the special case of Sturmian words. Mathem...
A finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for some no...
AbstractA finite non-empty word z is said to be a border of a finite non-empty word w if w=uz=zv for...
AbstractWe obtain new results on minimum lengths of words in an unavoidable set of words of cardinal...
AbstractWe consider repetitions in words and solve a longstanding open problem about the relation be...
AbstractAn unbordered word is a string over a finite alphabet such that none of its proper prefixes ...
AbstractAnswering an open problem in papers by Marcus and Pǎun (1994), we give here two examples of ...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
We investigate the behavior of the periods and border lengths of random words over a fixed alphabet....
Combinatorics on words is a field of mathematics and theoretical computer science that is concerned...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractGiven a language L and a non-deterministic finite automaton M, we consider whether we can de...
We shall give an introduction to the problem area concerning the well known Duval’s conjecture, whic...
DOI
Add to ORKG