On the power of recursive word-functions without concatenation

DOI10.1007/978-3-031-13257-5_3OpenAlexW4294344576MaRDI QIDQ2112176

Jérôme O. Durand-Lose

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_3

zbMATH Keywords

primitive recursionrecursion on wordsstring recursionword-functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new recursion-theoretic characterization of the polytime functions
• On primitive recursive wordfunctions
• On a theorem of Günter Asser
• Computability and Incomputability
• Recursive Word‐Functions over Infinite Alphabets
• New Computational Paradigms

This page was built for publication: On the power of recursive word-functions without concatenation