8 citations · 19 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Morphisms preserving the set of words coding three interval exchange
Tomáš Hejda
Any amicable pair ϕ, ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the n…
math.DS2011★ 1 cited
Greedy and lazy representations in negative base systems
Tomáš Hejda, Zuzana Masáková, Edita Pelantová
We consider positional numeration systems with negative real base , where , and study the extremal representations in these systems, called here the greedy and lazy repres…