The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Morphisms preserving the set of words coding three interval exchange

Tomáš Hejda — 2012

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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 number of amicable pairs with the same incidence matrix in SL(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms .

Morphisms preserving the set of words coding three interval exchange

Tomáš Hejda — 2012

RAIRO - Theoretical Informatics and Applications

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 number of amicable pairs with the same incidence matrix in SL(2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms .

Greedy and lazy representations in negative base systems

Tomáš HejdaZuzana MasákováEdita Pelantová — 2013

Kybernetika

We consider positional numeration systems with negative real base - β , where β > 1 , 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 β 2 with a non-integer alphabet. This enables us to characterize digit sequences admissible as greedy...

Page 1

Download Results (CSV)