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 2022Show all

3 papers · 1 filter

math.CO2022

Property of upper bounds on the number of rich words

Josef Rukavicka

A finite word $w$ is called \emph{rich} if it contains $∣ w ∣ + 1$ distinct palindromic factors including the empty word. Let $q \geq 2$ be the size of the alphabet. Let $R (n)$ …

math.CO2022

Upper bound for the number of privileged words

Josef Rukavicka

A non-empty word $w$ is a \emph{border} of a word $u$ if $∣ w ∣ < ∣ u ∣$ and $w$ is both a prefix and a suffix of $u$ . A word $u$ is \emph{privileged} if $\vert u\vert\…

cs.FL2022

Construction of a bi-infinite power free word with a given factor and a non-recurrent letter

Josef Rukavicka

Let $L_{k, α}^{Z}$ denote the set of all bi-infinite $α$ -power free words over an alphabet with $k$ letters, where $α$ is a positive rational number and $k$ is positive int…