scientific article; zbMATH DE number 7526052
From MaRDI portal
Publication:5076057
Publication date: 12 May 2022
Full work available at URL: https://arxiv.org/abs/1904.10105
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The IO- and OI-hierarchies
- Regular Cost Functions, Part I: Logic and Algebra over Words
- Strictness of the Collapsible Pushdown Hierarchy
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking
- A Note on Decidable Separability by Piecewise Testable Languages
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- On the Significance of the Collapse Operation
- A Saturation Method for Collapsible Pushdown Systems
- Recursion Schemes and the WMSO+U Logic
- An Approach to Computing Downward Closures
- Deciding Piecewise Testable Separability for Regular Tree Languages
- On word and frontier languages of unsafe higher-order grammars
- Two-way cost automata and cost logics over infinite trees
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
- Pumping Lemma for Higher-order Languages
- The Complexity of the Diagonal Problem for Recursion Schemes
- Pumping by Typing
- Relational semantics of linear logic and higher-order model-checking
- A characterization of lambda-terms transforming numerals
- Model Checking Higher-Order Programs
- A type-directed abstraction refinement approach to higher-order model checking
- Unsafe Order-2 Tree Languages Are Context-Sensitive
This page was built for publication:
