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.
Partial Order Turing Machine Infinite Sequence Finite Automaton Turing Degree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.
Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications Generalizations. Cambridge University Press, New York (2003)CrossRefGoogle Scholar
Belov, A.: Some algebraic properties of machine poset of infinite words. ITA 42(3), 451–466 (2008)Google Scholar
Endrullis, J., Grabmayer, C., Hendriks, D., Zantema, H.: The Degree of Squares is an Atom (2015)Google Scholar
Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. J. integers 11B(A6), 1–40 (2011). Proceedings of the Leiden Numeration Conference 2010MathSciNetGoogle Scholar