The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 27 (1-2) , 3-38
- https://doi.org/10.1016/0304-3975(83)90091-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Complexity of Flowchart and Loop Program Schemes and Programming LanguagesJournal of the ACM, 1982
- A theory of complexity of monadic recursion schemesRAIRO. Informatique théorique, 1981
- On the Computational Complexity of Program Scheme EquivalenceSIAM Journal on Computing, 1980
- Monadic recursion schemes: The effect of constantsJournal of Computer and System Sciences, 1979
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- Equivalence problems for deterministic context-free languages and monadic recursion schemesJournal of Computer and System Sciences, 1977
- Functional schemas with nested predicatesInformation and Control, 1975
- Decidable Properties of Monadic Functional SchemasJournal of the ACM, 1973
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970