scientific article; zbMATH DE number 7243673

MaRDI QIDQ5119391

Paweł Parys

Publication date: 4 September 2020

Full work available at URL: https://arxiv.org/abs/2008.00650

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Cost Automata, Safe Schemes, and Downward Closures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shrinking lemma for indexed languages
• On the structure of graphs in the Caucal hierarchy
• Iterated stack automata and complexity classes
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Reachability in Higher-Order-Counters
• Strictness of the Collapsible Pushdown Hierarchy
• A Pumping Lemma for Collapsible Pushdown Graphs of Level 2
• On the Significance of the Collapse Operation
• Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
• A Saturation Method for Collapsible Pushdown Systems
• Collapsible Pushdown Automata and Recursion Schemes
• Typed Lambda Calculi and Applications
• Automata, Languages and Programming
• Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

This page was built for publication: