


default search action
"The Complexity of Monadic Recursion Schemes: Executability Problems, ..."
Harry B. Hunt III, Daniel J. Rosenkrantz (1983)
- Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. Theor. Comput. Sci. 27: 3-38 (1983)

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.