A Theory of Complexity of Monadic Recursion Schemes

RAIRO. Informatique théorique
doi 10.1051/ita/1981150100671
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

Collapsible Pushdown Automata and Recursion Schemes

Proceedings - Symposium on Logic in Computer Science
MathematicsSoftware
2008English

Book Review: Fundamentals of Generalized Recursion Theory

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Book Review: Classical Recursion Theory

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Towards a Theory of Phonological Complexity

Linguistics in the Netherlands
LinguisticsPsychologyLanguageHealth ProfessionsMultidisciplinarySocial Sciences
1991English

On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A1-Homotopy Theory of Schemes

Publications Mathématiques
Mathematics
1999English

Complexity Theory

English

Syntax and Semantics in Higher-Type Recursion Theory

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1983English

Recursion and Double Recursion

Bulletin of the American Mathematical Society
1948English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy