A theory of complexity of monadic recursion schemes
Open Access
- 1 January 1981
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 15 (1) , 67-94
- https://doi.org/10.1051/ita/1981150100671
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 6 references indexed in Scilit:
- The computational complexity of program schemataJournal of Computer and System Sciences, 1976
- Theory of Program Structures: Schemes, Semantics, VerificationPublished by Springer Nature ,1975
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- Type two computational complexityPublished by Association for Computing Machinery (ACM) ,1973
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A helpful result for proving inherent ambiguityTheory of Computing Systems, 1968