On primitive recursive wordfunctions

DOI10.1007/BF02242369zbMath0317.02041OpenAlexW117031590MaRDI QIDQ1221752

Friedrich W. von Henke, Gene F. Rose, Klaus Indermark, Weihrauch, Klaus

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242369

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (5)

On the computational power of automata with time or space bounded by Ackermann's or superexponential functions ⋮ A hierarchy of loop programs over binary trees ⋮ Modular tree transducers ⋮ On the power of recursive word-functions without concatenation ⋮ Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of recursive functions based on Ackermann's function
• A note on comparison of subrecursive hierarchies
• Rekursive Wortfunktionen
• Classes of Predictably Computable Functions
• Iteration of Primitive Recursion
• A universal two-way automaton
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• A Classification of the Recursive Functions
• Über die mit Stackautomaten berechenbaren Funktionen

This page was built for publication: On primitive recursive wordfunctions