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.
For Turing Machines, this structure of degrees is well-studied and known as degrees of unsolvability. However, in this hierarchy, all the computable streams are identified in the bottom degree. It is therefore interesting to study transducibility with respect to weaker computational models, giving rise to more fine-grained structures of degrees. In contrast with the degrees of unsolvability, very little is known about the structure of degrees obtained from finite state transducers or Mealy Machines.
- 2.Belov, A.: Some algebraic properties of machine poset of infinite words. ITA 42(3), 451–466 (2008)Google Scholar
- 3.Endrullis, J., Grabmayer, C., Hendriks, D., Zantema, H.: The Degree of Squares is an Atom (2015)Google Scholar
- 6.Endrullis, J., Hendriks, D., Klop, J.W.: Streams are forever. Bull. EATCS 109, 70–106 (2013)Google Scholar
- 7.Jacobs, K.: Invitation to mathematics. Princeton University Press (1992)Google Scholar
- 11.Sakarovitch, J.: Elements of Automata Theory. Cambridge (2003)Google Scholar