Greedy and lazy representations in negative base systems
Tomáš Hejda, Zuzana Masáková, Edita Pelantová (2013)
Kybernetika
Similarity:
We consider positional numeration systems with negative real base , where , and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of minimal and maximal -representation with respect to the alternate order. We also show that both extremal representations can be obtained as representations in the positive base with a non-integer alphabet. This enables us to characterize digit sequences admissible...