Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications Generalizations. Cambridge University Press, New York (2003)
Belov, A.: Some algebraic properties of machine poset of infinite words. ITA 42(3), 451–466 (2008)
Endrullis, J., Grabmayer, C., Hendriks, D., Zantema, H.: The Degree of Squares is an Atom (2015)
Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. J. integers 11B(A6), 1–40 (2011). Proceedings of the Leiden Numeration Conference 2010
Endrullis, J., Hendriks, D., Klop, J.W.: Highlights in infinitary rewriting and lambda calculus. Theor. Comput. Sci. 464, 48–71 (2012)
Endrullis, J., Hendriks, D., Klop, J.W.: Streams are forever. Bull. EATCS 109, 70–106 (2013)
Jacobs, K.: Invitation to mathematics. Princeton University Press (1992)
Kleene, S.C., Post, E.L.: The upper semi-lattice of degrees of recursive unsolvability. Ann. Math. 59(3), 379–407 (1954)
Odifreddi, P.: Classical Recursion Theory. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam (1999)
Rayna, G.: Degrees of finite-state transformability. Inf. Control 24(2), 144–154 (1974)
Sakarovitch, J.: Elements of Automata Theory. Cambridge (2003)
Shoenfield, J.R.: Degrees of Unsolvability. North-Holland, Elsevier (1971)
Shore, R.A.: Conjectures and questions from Gerald Sacks’s degrees of unsolvability. Arch. Math. Logic 36(4–5), 233–253 (1997)
Siefkes, D.: Undecidable extensions of monadic second order successor arithmetic. Math. Logic Q. 17(1), 385–394 (1971)
Soare, R.I.: Recursively enumerable sets and degrees. Bull. Am. Math. Soc. 84(6), 1149–1181 (1978)
Spector, C.: On degrees of recursive unsolvability. Ann. Math. 64, 581–592 (1956)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Endrullis, J., Klop, J.W., Saarela, A., Whiteland, M. (2015). Degrees of Transducibility. In: Manea, F., Nowotka, D. (eds) Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science(), vol 9304. Springer, Cham. https://doi.org/10.1007/978-3-319-23660-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-23660-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23659-9
Online ISBN: 978-3-319-23660-5
eBook Packages: Computer ScienceComputer Science (R0)