Collapsible Pushdown Automata and Recursion Schemes

DOI10.1145/3091122zbMath1407.68256OpenAlexW2102644483MaRDI QIDQ5369241

No author found.

Publication date: 16 October 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

higher-order recursion schemeshigher-order (collapsible) pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

FO Model Checking on Nested Pushdown Trees, Colored nested words, Typing Weak MSOL Properties, Cost Automata, Safe Schemes, and Downward Closures, Reachability for Dynamic Parametric Processes, Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems, Krivine Machines and Higher-Order Schemes, Unnamed Item, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, Unnamed Item, General decidability results for asynchronous shared-memory programs: higher-order and beyond, Unnamed Item, Unnamed Item, Unnamed Item, Games on Higher Order Multi-stack Pushdown Systems, Domains for Higher-Order Games, The Complexity of the Diagonal Problem for Recursion Schemes