The complexity of monadic recursion schemes: executability problems, nesting depth, and applications

From MaRDI portal
Publication:792758

DOI10.1016/0304-3975(83)90091-9zbMath0537.68039OpenAlexW2085033370MaRDI QIDQ792758

Daniel J. Rosenkrantz, Harry B. III Hunt

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90091-9



Related Items



Cites Work