scientific article; zbMATH DE number 2038738

MaRDI QIDQ4449203zbMATH OpenFDO

Authors Thierry Cachat

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190556.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80)

Recommendations

• On the structure of graphs in the Caucal hierarchy
• Positional Strategies for Higher-Order Pushdown Parity Games
• Games on Higher Order Multi-stack Pushdown Systems
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Two-Way Tree Automata Solving Pushdown Games

Cited in

(20)

• On first-order logic and CPDA graphs
• The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
• Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
• Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
• Winning Regions of Pushdown Parity Games: A Saturation Method
• Infinite games specified by 2-tape automata
• An automata-theoretic approach to infinite-state systems
• Positional Strategies for Higher-Order Pushdown Parity Games
• Games on Higher Order Multi-stack Pushdown Systems
• Two-Way Tree Automata Solving Pushdown Games
• Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
• Optimal strategies in pushdown reachability games
• A type-directed negation elimination
• Collapsible pushdown parity games
• Optimally Resilient Strategies in Pushdown Safety Games
• Domains for Higher-Order Games
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A saturation method for the modal \(\mu \)-calculus over pushdown systems
• Regular sets over extended tree structures
• On the structure of graphs in the Caucal hierarchy

This page was built for publication:

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