Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection

DOI10.1109/LICS.2012.73zbMath1360.68543OpenAlexW2055765422MaRDI QIDQ2986793

Olivier Serre, Arnaud Carayol

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.73

zbMATH Keywords

safety constraintrecursion schemescollapsible pushdown automataMSO effective selection

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (10)

Rewriting Higher-Order Stack Trees ⋮ Rewriting higher-order stack trees ⋮ Recursion Schemes and the WMSO+U Logic ⋮ Finitary Semantics of Linear Logic and Higher-Order Model-Checking ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Krivine machines and higher-order schemes ⋮ On first-order logic and CPDA graphs ⋮ Unnamed Item

This page was built for publication: Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection