Josef Rukavicka

activity

20172026

most citedOn Number of Rich Words

8 citations · 28 across the 18 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

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★ 3 cited

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…

math.CO2019★ 2 cited

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…