Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
This article has been cited by the following article(s):
The complexity of monadic recursion schemes: Executability problems, nesting depth, and applicationsH.B. Hunt and D.J. Rosenkrantz
Theoretical Computer Science 27 (1-2) 3 (1983)
See this article