Josef Rukavicka

collaborators

3 papers

math.CO2025

Subexponential upper bound on the number of rich words

Josef Rukavicka

Let $R (n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $lim_{n \to \infty} n R (n) = 1$ ; it means the number…

cs.FL2025

Restivo Salemi property for $I^\pm$ -power free languages with $I^\pm \geq 5$ and $k \geq 3$ letters

Josef Rukavicka

In 2009, Shur published the following conjecture: Let $L$ be a power-free language and let $e (L) \subseteq L$ be the set of words of $L$ that can be extended to a bi-infinite word r…

math.CO2024

Palindromic length of infinite aperiodic words

Josef Rukavicka

The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$ . It was conjectured in 2013 that for every infinite…

Subexponential upper bound on the number of rich words

Restivo Salemi property for I^±-power free languages with I^±≥5 and k≥3 letters

Palindromic length of infinite aperiodic words

Restivo Salemi property for $I^\pm$ -power free languages with $I^\pm \geq 5$ and $k \geq 3$ letters