AbstractGiven positive integers n, and p1,…,pr, we establish a fast word combinatorial algorithm for constructing a word w=w1⋯wn of length n, with periods p1,…,pr, and on the maximal number of distinct letters. Moreover, we show that the constructed word, which is unique up to word isomorphism, is a pseudo-palindrome — i.e. it is a fixed point of an involutory antimorphism
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
AbstractLet w = w1 … wn be a word of maximal length n, and with a maximal number of distinct letters...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
In this note we consider the longest word, which has periods p1,...,pn, and does not have the period...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
We present a method which displays all palindromes of a given length from De Bruijn words of a certa...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
Let w = w1 :::wn be a word of maximal length n, and with a maximal number of distinct letters for t...
AbstractLet w = w1 … wn be a word of maximal length n, and with a maximal number of distinct letters...
Given a finite word u, we define its palindromic length |u|pal to be the least number n such that u ...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
In this note we consider the longest word, which has periods p1,...,pn, and does not have the period...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
AbstractIn this paper we give a characterization of finite Sturmian words, by palindrome words, whic...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1,...
We present a method which displays all palindromes of a given length from De Bruijn words of a certa...
In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to th...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
In this thesis, we explore different problems at the intersection of combinatorics on words and disc...
DOI
Add to ORKG