Josef Rukavicka

activity

20172026

most citedPalindromic factorization of rich words

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

collaborators

Showing 2019 · cs.DMShow all

2 papers · 2 filters

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…

cs.DM2019

A Unique Extension of Rich Words

Josef Rukavicka

A word $w$ is called rich if it contains $∣ w ∣ + 1$ palindromic factors, including the empty word. We say that a rich word $w$ can be extended in at least two ways if there are two d…