Degrees of Transducibility

DOI10.1007/978-3-319-23660-5_1zbMath1330.68073OpenAlexW2275937557MaRDI QIDQ3449352

Jan Willem Klop, Aleksi Saarela, Markus A. Whiteland, Jörg Endrullis

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Transducer degrees: atoms, infima and suprema ⋮ Braids via term rewriting ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ On the Complexity of Infinite Advice Strings ⋮ Ordering sequences by permutation transducers ⋮ Unnamed Item ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Finite transducers and rational transductions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Classical recursion theory. Vol. II
• Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
• Highlights in infinitary rewriting and lambda calculus
• The upper semi-lattice of degrees of recursive unsolvability
• The Degree of Squares is an Atom
• Some Algebraic Properties of Machine Poset of Infinite Words
• Recursively enumerable sets and degrees
• Degrees of finite-state transformability
• Automatic Sequences
• Undecidable Extensions of Monadic Second Order Successor Arithmetic

This page was built for publication: Degrees of Transducibility