16 citations · 71 across the 14 of their papers we have counts for
14 papers
On Periodicity and Complexity of Generalized Pseudostandard Words
Josef Florian, Lubomira Balkova
Generalized pseudostandard words have been introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the…
Aperiodic pseudorandom number generators based on infinite words
Lubomira Balkova, Michelangelo Bucci, Alessandro De Luca +2
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We i…
Proof of Brlek-Reutenauer conjecture
Lubomira Balkova, Edita Pelantova, Stepan Starosta
Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u) = \sum_{n=0}^{\infty}T_u(n) in which D(u) denotes the def…
Factor frequencies in generalized Thue-Morse words
Lubomira Balkova
We describe factor frequencies of the generalized Thue-Morse word t_{b,m} defined for integers b greater than 1, m greater than 0 as the fixed point starting in 0 of the morphism ϕ…
Factor frequencies in languages invariant under more symmetries
Lubomira Balkova
The number of frequencies of factors of length in a recurrent aperiodic infinite word does not exceed $3Δ\C(n)$, where $Δ\C (n)$ is the first difference of factor complexity,…
Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers
Ľubomíra Balková, Karel Břinda, Ondřej Turek
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.