research
∙
12/18/2022
Property of upper bounds on the number of rich words
A finite word w is called rich if it contains | w|+1 distinct palindromi...
share
research
∙
05/25/2022
Upper bound for the number of privileged words
A non-empty word w is a border of a word u if | w|<| u| and w is both a ...
research
∙
02/24/2022
Construction of a bi-infinite power free word with a given factor and a non-recurrent letter
Let L_k,α^ℤ denote the set of all bi-infinite α-power free words over an...
research
∙
10/25/2021
Palindromic factorization of rich words
A finite word w is called rich if it contains | w|+1 distinct palindromi...
research
∙
03/26/2021
Palindromic Length and Reduction of Powers
Given a nonempty finite word v, let PL(v) be the palindromic length of v...
research
∙
06/26/2020
Dissecting Power of a Finite Intersection of Context Free Languages
Let ^k,α denote a tetration function defined as follows: ^1,α=2^α and ^k...
research
∙
05/04/2020
Palindromic Length of Words with Many Periodic Palindromes
The palindromic length PL(v) of a finite word v is the minimal number of...
research
∙
01/07/2020
Transition Property for α-Power Free Languages with α≥ 2 and k≥ 3 Letters
In 1985, Restivo and Salemi presented a list of five problems concerning...
research
∙
11/25/2019
Upper bound for the number of closed and privileged words
A non-empty word w is a border of the word u if | w|<| u| and w is both ...
research
∙
10/02/2019