The complexity of monadic recursion schemes: exponential time bounds

H.B. Hunt, D.J. Rosenkrantz
<span title="">1984</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
We study the computational complexity of decision problems for the class X of monadic recursion schemes. By the "executability problem" for a class 'r of monadic recursion schemes, we mean the problem of determining whether a given defined function symbol of a given scheme in .Y can be called during at least one computation. The executability problem for a class V of very simple monadic recursion schemes is shown to require deterministic exponential time. Using arguments about executability
more &raquo; ... lems and about the class Q, a number of decision problems for X and for several of X's subclasses are shown to require deterministic exponential time. Deterministic exponential time upper bounds are also presented for several of these decision problems. * A preliminary version of some of these results was presented at the
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/0022-0000(84)90021-7</a> <a target="_blank" rel="external noopener" href="">fatcat:lel4ewpltzbprgjwjb3vaapofq</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>