L. Balková

most citedPalindromic complexity of infinite words associated with non-simple Parry numbers

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008

Palindromic Saturation

L. Balková, E. Pelantová

We consider two {seemingly} different definitions of infinite words which contain {the} utmost number of palindromes. We show that these two definitions coincide. {The keynote of t…

math.CO2006★ 1 cited

Palindromic complexity of infinite words associated with non-simple Parry numbers

L'ubomíra Balková, Zuzana Masáková

We study the palindromic complexity of infinite words $u_{β}$ , the fixed points of the substitution over a binary alphabet, $ϕ (0) = 0^{a} 1$ , $ϕ (1) = 0^{b} 1$ , with $a - 1 \geq b \geq 1$ , which ar…