Josef Rukavicka

activity

20182020

most citedUpper bound for the number of closed and privileged words

2 citations · 2 across the 1 of their papers we have counts for

collaborators

4 papers

cs.FL2020

Palindromic Length of Words with Many Periodic Palindromes

Josef Rukavicka

The palindromic length $PL (v)$ of a finite word $v$ is the minimal number of palindromes whose concatenation is equal to $v$ . In 2013, Frid, Puzynina, and Zamboni conjecture…

cs.DM2019★ 2 cited

Upper bound for the number of closed and privileged words

Josef Rukavicka

A non-empty word $w$ is a border of the word $u$ if $∣ w ∣ < ∣ u ∣$ and $w$ is both a prefix and a suffix of $u$ . A word $u$ with the border $w$ is closed if $u$ has ex…

math.CO2019

Construction Of A Rich Word Containing Given Two Factors

Josef Rukavicka

A finite word $w$ with $∣ w ∣ = n$ contains at most $n + 1$ distinct palindromic factors. If the bound $n + 1$ is attained, the word $w$ is called \emph{rich}. Let $\Factor(w)$ be…

math.CO2018

Upper Bound for Palindromic and Factor Complexity of Rich Words

Josef Rukavicka

A finite word $w$ of length $n$ contains at most $n + 1$ distinct palindromic factors. If the bound $n + 1$ is attained, the word $w$ is called rich. An infinite word $w$ is called ric…