10 citations · 28 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 2 cited
Derivated sequences of complementary symmetric Rote sequences
Kateřina Medková, Edita Pelantová, Laurent Vuillon
Complementary symmetric Rote sequences are binary sequences which have factor complexity for all integers and whose languages are closed under the…
math.CO2018★ 1 cited
Palindromic length of words and morphisms in class
Petr Ambrož, Ondřej Kadlec, Zuzana Masáková +1
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class introduced by Hof, Knill and Simon. We show that it grows at mo…
math.CO2018
A note on palindromic length of Sturmian sequences
Petr Ambrož, Edita Pelantová
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word as the minimal number of palindromes whose concatenation is equal to . For an infinite word…