The complexity of monadic recursion schemes: Exponential time bounds
DOI10.1016/0022-0000(84)90021-7zbMATH Open0543.68034OpenAlexW2013008477MaRDI QIDQ796301FDOQ796301
Authors: H. B. III Hunt, Daniel J. Rosenkrantz 
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90021-7
Recommendations
- Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze
- On the Hoare theory of monadic recursion schemes
- The Hoare logic of deterministic and nondeterministic monadic recursion schemes
- Decidable properties of monadic recursive schemas with a depth parameter
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Decidable Properties of Monadic Functional Schemas
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- On Ianov's Program Schemata
- On the Computational Complexity of Program Scheme Equivalence
- On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
- Monadic recursion schemes: The effect of constants
- Functional schemas with nested predicates
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: The complexity of monadic recursion schemes: Exponential time bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796301)
