9 citations · 13 across the 3 of their papers we have counts for
6 papers
A characterization of Sturmian sequences by indistinguishable asymptotic pairs
Sebastián Barbieri, Sébastien Labbé, Štěpán Starosta
We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full -shift are indistingu…
On Sturmian substitutions closed under derivation
Edita Pelantová, Štěpán Starosta
Occurrences of a factor in an infinite uniformly recurrent sequence can be encoded by an infinite sequence over a finite alphabet. This sequence is usually denoted ${…
On substitutions closed under derivation: examples
Václav Košík, Štěpán Starosta
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are…
Bounds on the period of the continued fraction after a Möbius transformation
Hanka Řada, Štěpán Starosta
We study Möbius transformations (also known as linear fractional transformations) of quadratic numbers. We construct explicit upper and lower bounds on the period of the continued…
On Words with the Zero Palindromic Defect
Edita Pelantová, Štěpán Starosta
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich w…
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…