Degrees of transducibility

DOI10.1007/978-3-319-23660-5_1zbMATH Open1330.68073OpenAlexW2275937557MaRDI QIDQ3449352FDOQ3449352

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

Recommendations

• Transducer degrees: atoms, infima and suprema
• The degree of squares is an atom
• Degrees of infinite words, polynomials and atoms
• Degrees of streams
• Degrees of Infinite Words, Polynomials and Atoms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

Cited In (9)

• Transducer degrees: atoms, infima and suprema
• On the Complexity of Infinite Advice Strings
• Finite transducers and rational transductions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordering sequences by permutation transducers
• Braids via term rewriting
• Degrees of Infinite Words, Polynomials and Atoms
• Degrees of Infinite Words, Polynomials and Atoms

This page was built for publication: Degrees of transducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449352)