On primitive recursive wordfunctions

DOI10.1007/BF02242369MaRDI QIDQ1221752zbMATH OpenOpenAlexFDO

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

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)

Cites work

• scientific article; zbMATH DE number 3458598 (Why is no real title available?)
• scientific article; zbMATH DE number 3506660 (Why is no real title available?)
• scientific article; zbMATH DE number 3556037 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• A Classification of the Recursive Functions
• A note on comparison of subrecursive hierarchies
• A universal two-way automaton
• Classes of Predictably Computable Functions
• Classes of recursive functions based on Ackermann's function
• Iteration of Primitive Recursion
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Rekursive Wortfunktionen
• Über die mit Stackautomaten berechenbaren Funktionen

Cited in

(5)

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

This page was built for publication: On primitive recursive wordfunctions

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