Markus A. Whiteland

Degrees of Transducibility

Our objects of study are infinite sequences and how they can be transformed into each other. As transformational devices, we focus here on Turing Machines, sequential finite state transducers and Mealy Machines. For each of these choices, the resulting transducibility relation \(\ge \) is a preorder on the set of infinite sequences. This preorder induces equivalence classes, called degrees, and a partial order on the degrees.

On cardinalities of k-abelian equivalence classes

Two words

k-Abelian Equivalence and Rationality

u

A Square Root Map on Sturmian Words

and

Regularity of k-Abelian Equivalence Classes of Fixed Cardinality

v

More on the Dynamics of the Symbolic Square Root Map - (Extended Abstract).

are

On Abelian Subshifts.

k

On

-abelian equivalent if, for each word

k

x

-abelian Equivalence and Generalized Lagrange Spectra

of length at most