Two-way tree automata solving pushdown games
From MaRDI portal
Recommendations
- Formats of winning strategies for six types of pushdown games
- Winning Regions of Pushdown Parity Games: A Saturation Method
- Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
- Symbolic strategy synthesis for games on pushdown graphs
- Pushdown processes: Games and model-checking
Cited in
(16)- Evaluating Datalog via tree automata and cycluits
- Uniform solution of parity games on prefix-recognizable graphs
- Positional Strategies for Higher-Order Pushdown Parity Games
- Games on Multi-stack Pushdown Systems
- Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
- Symbolic strategy synthesis for games on pushdown graphs
- The complexity of flat freeze LTL
- Playing pushdown parity games in a hurry
- Collapsible pushdown parity games
- The complexity of flat freeze LTL
- Formats of winning strategies for six types of pushdown games
- Parity and exploration games on infinite graphs
- Fundamentals of Computation Theory
- Church synthesis on register automata over linearly ordered data domains
- Perspective games
- Pushdown module checking
This page was built for publication: Two-way tree automata solving pushdown games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412840)