5 citations · 16 across the 16 of their papers we have counts for
Showing 2006 · math.COShow all
2 papers · 2 filters
math.CO2006
Self-Matching Properties of Beatty Sequences
Zuzana Masáková, Edita Pelantová
We study the selfmatching properties of Beatty sequences, in particular of the graph of the function against for every quadratic unit . We show…
math.CO2006
Factor versus palindromic complexity of uniformly recurrent infinite words
Peter Baláži, Zuzana Masáková, Edita Pelantová
We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq ΔC(n) + 2, for all n \in…