Search

Lyndon words have been extensively studied in different contexts of free Lie algebra and combinatorics. All Lyndon and Nyldon words are primitive and any primitive class of words contains an unique Lyndon and an unique Nyldon word. This property motivated the study of Lyndon partial word which is primitive but all primitive classes of partial words may not contain a Lyndon partial word. In this paper we introduce two variants of Lyndon partial words namely Nyldon and inverse Lyndon partial words which are constructed from the decreasing alphabetical order. We compare the properties of the variants with those of Lyndon partial words. [ABSTRACT FROM AUTHOR]

Many classes of finite words have noticeable properties with reference to their palindromic factors and one among them are the words having zero palindromic defect i.e., words rich in palindromes. In this paper we introduce rich partial word and discuss its combinatorial properties. We show that the palindromic richness of a partial word can be studied by including the positions of the missing symbols in that word. The significant difference between rich and rich partial word is that a rich word of length n contains exactly n + 1 distinct palindromic factors whereas a rich partial word of length n contains at least n + 1 distinct palindromic factors. These factors differ from the classical palindromes due to the presence of holes. [ABSTRACT FROM AUTHOR]

Combinatorial and algorithmic properties of Lyndon words have been investigated. Lyndon words have wide usage in algebra and pattern matching. In this paper, we introduce Lyndon partial words and show that the language of all Lyndon partial words over the binary alphabet is not context free. [ABSTRACT FROM AUTHOR]