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 cs.FLShow all

5 papers · 1 filter

cs.FL2023

Restivo Salemi property for $α$ -power free languages with $α \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…

cs.FL2023

Note on dissecting power of regular languages

Josef Rukavicka

Let $c > 1$ be a real constant. We say that a language $L$ is $c$ -\emph{constantly growing} if for every word $u \in L$ there is a word $v \in L$ with $\vert u\vert<\vert v\vert\leq c+…

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…

cs.FL2020

Dissecting power of intersection of two context-free languages

Josef Rukavicka

We say that a language $L$ is \emph{constantly growing} if there is a constant $c$ such that for every word $u \in L$ there is a word $v \in L$ with $\vert u\vert<\vert v\vert\leq c+…

cs.FL2020★ 2 cited

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…

Restivo Salemi property for α-power free languages with α≥5 and k≥3 letters

Note on dissecting power of regular languages

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

Dissecting power of intersection of two context-free languages

Palindromic Length of Words with Many Periodic Palindromes

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