Higher-order pushdown trees are easy
From MaRDI portal
Recommendations
Cited in
(60)- Shelah-Stupp's and Muchnik's iterations revisited
- On first-order logic and CPDA graphs
- Epsilon-reducible context-free languages and characterizations of indexed languages
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
- The IO and OI hierarchies revisited
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
- Verification of opacity and diagnosability for pushdown systems
- Rewriting higher-order stack trees
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- Contribution of Warsaw logicians to computational logic
- Iterated pushdown automata and sequences of rational numbers
- Marking shortest paths on pushdown graphs does not preserve MSO decidability
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
- Deciding monadic theories of hyperalgebraic trees
- Unboundedness and downward closures of higher-order pushdown automata
- Rewriting in the partial algebra of typed terms modulo AC
- Model-checking games for typed -calculi
- The grammar of mammalian brain capacity
- Finitary semantics of linear logic and higher-order model-checking
- First-order logic on higher-order nested pushdown trees
- Almost every simply typed -term has a long -reduction sequence
- Krivine machines and higher-order schemes
- The mu-calculus and Model Checking
- Rewriting higher-order stack trees
- Recursion schemes and the WMSO+U logic
- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- A theory of second-order trees
- Krivine machines and higher-order schemes
- Model checking and higher-order recursion
- Higher-order pushdown systems with data
- Homogeneity without loss of generality
- Parity to safety in polynomial time for pushdown and collapsible pushdown systems
- Intersection types for unboundedness problems
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
- Recursion schemes, the MSO logic, and the \textsf{U} quantifier
- Domains for Higher-Order Games
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- On the expressive power of higher-order pushdown systems
- On the termination problem for probabilistic higher-order recursive programs
- Higher-order parity automata
- Automata, Logic and Games for the $$\lambda $$ -Calculus
- Functional programs as compressed data
- Ordered tree-pushdown systems
- Mathematical Foundations of Computer Science 2005
- Typed Lambda Calculi and Applications
- Foundations of Software Science and Computational Structures
- Second-Order Simple Grammars
- Cost Automata, Safe Schemes, and Downward Closures
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms
- Cost automata, safe schemes, and downward closures
- On average-case hardness of higher-order model checking
- Extending the WMSO+U logic with quantification over tuples
- The structure of trees in the pushdown hierarchy
- On regular trees defined from unfoldings and coverings
- Higher-order model checking step by step
- Tree representations of infinite words and their logical properties
- Regular sets over extended tree structures
- On the structure of graphs in the Caucal hierarchy
This page was built for publication: Higher-order pushdown trees are easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738227)
