activity
20002022
most citedLanguages invariant under more symmetries: overlapping factors versus palindromic richness

20 citations · 185 across the 45 of their papers we have counts for

collaborators

51 papers

math.CO2022★ 1 cited

On a faithful representation of Sturmian morphisms

Jana Lepšová, Edita Pelantová, Štěpán Starosta

The set of morphisms mapping any Sturmian sequence to a Sturmian sequence forms together with composition the so-called monoid of Sturm. For this monoid, we defne a faithful repres…

cs.FL2021★ 9 cited

On balanced sequences and their critical exponent

Francesco Dolce, Lubomira Dvorakova, Edita Pelantova

We study aperiodic balanced sequences over finite alphabets. A sequence vv of this type is fully characterised by a Sturmian sequence u and two constant gap sequences y and y'. We…

math.CO2020★ 10 cited

Complementary symmetric Rote sequences: the critical exponent and the recurrence function

Lubomíra Dvořáková, Kateřina Medková, Edita Pelantová

We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions a…

math.CO2020

On non-repetitive complexity of Arnoux-Rauzy words

Kateřina Medková, Edita Pelantová, Élise Vandomme

The non-repetitive complexity and the initial non-repetitive complexity are functions which reflect the structure of the infinite w…

math.CO2019

Morphisms generating antipalindromic words

Petr Ambrož, Zuzana Masáková, Edita Pelantová

We introduce two classes of morphisms over the alphabet whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant…

math.CO2018★ 6 cited

Fixed points of Sturmian morphisms and their derivated words

Karel Klouda, Kateřina Medková, Edita Pelantová +1

Any infinite uniformly recurrent word can be written as concatenation of a finite number of return words to a chosen prefix of . Ordering of the return words…