3 citations · 7 across the 16 of their papers we have counts for
22 papers
Reflection on the reflection complexity
Lubomíra Dvořáková, Edita Pelantová
The factor complexity of a sequence over a finite alphabet counts the number of factors of length occurring in $\mat…
Attractors of sequences coding -integers
Lubomíra Dvořáková, Martina Moravcová
In this paper, we describe minimal string attractors of prefixes of simple Parry sequences. These sequences form a coding of distances between consecutive -integers in numeratio…
On a sequence of Kimberling and its relationship to the Tribonacci word
Lubomíra Dvořáková, Edita Pelantová, Jeffrey Shallit
In 2017, Clark Kimberling defined an interesting sequence of 's and 's by certain inflation rules, and he made a number of conjectures about thi…
The limit of repetition thresholds of rich sequences
Lubomíra Dvořáková, Edita Pelantová
The repetition threshold of a class of sequences is the smallest number such that a sequence from the class contains no repetition with exponent . We focus on the class $\…
Frequencies of letters in infinite -balanced sequences
Lubomíra Dvořáková, Edita Pelantová
Frequency of letters in a symbolic sequence over a finite alphabet is one of the basic characteristics of . The notion of -balancedness captures the property…
Critical exponent of ternary words with few distinct palindromes
Ľubomíra Dvořáková, Lucas Mol, Pascal Ochem
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.