A hierarchy of loop programs over binary trees

DOI10.1080/00207168608803501zbMath0655.68051OpenAlexW1992609958MaRDI QIDQ3802613

Margherita Napoli, Emanuela Fachini

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803501

zbMATH Keywords

decision problemscomplexity hierarchyprimitive recursive functionsdepth of nestingloop programs over binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Some Hierarchies of Primitive Recursive Functions on Term Algebras

Cites Work

• Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
• Tree correspondence problems
• On primitive recursive wordfunctions
• Comparing Hierarchies of Primitive Recursive Sequence Functions
• A Hierarchy of Primitive Recursive Functions

This page was built for publication: A hierarchy of loop programs over binary trees