The complexity of monadic recursion schemes: exponential time bounds
- 30 June 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 28 (3) , 395-419
- https://doi.org/10.1016/0022-0000(84)90021-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of monadic recursion schemes: Executability problems, nesting depth, and applicationsTheoretical Computer Science, 1983
- On the Complexity of Flowchart and Loop Program Schemes and Programming LanguagesJournal of the ACM, 1982
- 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
- 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
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- On Ianov's Program SchemataJournal of the ACM, 1964