Higher-Order Pushdown Trees Are Easy

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45931-6_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Higher-Order Analysis of 2–3 Trees

International Journal of Foundations of Computer Science
Computer Science
1995English

Equivalences of Pushdown Systems Are Hard

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Higher-Order Containers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Higher-Order Uncertainty

2019English

Higher Order Operations

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1963English

Higher-Order Logic

1998English

Higher Order Crossings

1993English

Some Artin–Schreier Towers Are Easy

Moscow Mathematical Journal
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy