A Saturation Method for Collapsible Pushdown Systems

DOI10.1007/978-3-642-31585-5_18MaRDI QIDQ3167009zbMATH OpenOpenAlexFDO

Authors Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre

Publication date 1 November 2012

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31585-5_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Saturation of Concurrent Collapsible Pushdown Systems
• Variants of collapsible pushdown systems
• scientific article; zbMATH DE number 7361952
• A saturation method for the modal \(\mu \)-calculus over pushdown systems
• Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
• Parity to safety in polynomial time for pushdown and collapsible pushdown systems
• The complexity of model checking (collapsible) higher-order pushdown systems
• Collapsibility of read/write models using discrete Morse theory
• Dynamics of a piecewise linear system subjected to a saturation constraint
• scientific article; zbMATH DE number 4154258

Cited in

(10)

• On first-order logic and CPDA graphs
• Rewriting higher-order stack trees
• Saturation of Concurrent Collapsible Pushdown Systems
• Simply typed fixpoint calculus and collapsible pushdown automata
• Rewriting higher-order stack trees
• Krivine machines and higher-order schemes
• Intersection types for unboundedness problems
• Domains for Higher-Order Games
• On the expressive power of higher-order pushdown systems
• On the complexity of multi-pushdown games

This page was built for publication: A Saturation Method for Collapsible Pushdown Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167009)