Note on winning positions on pushdown games with \(\omega\)-regular conditions

DOI10.1016/S0020-0190(02)00445-3zbMath1173.68558MaRDI QIDQ1007544

Olivier Serre

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

automatapushdown processesgamesinfinite graphs

Mathematics Subject Classification ID

2-person games (91A05) Formal languages and automata (68Q45)

Related Items (8)

Winning Regions of Pushdown Parity Games: A Saturation Method ⋮ Efficient CTL model-checking for pushdown systems ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ A saturation method for the modal \(\mu \)-calculus over pushdown systems ⋮ Games on Multi-stack Pushdown Systems ⋮ On Global Model Checking Trees Generated by Higher-Order Recursion Schemes ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Games with winning conditions of high Borel complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of ends, pushdown automata, and second-order logic
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Pushdown processes: Games and model-checking
• Alternation
• On the synthesis of strategies in infinite games

This page was built for publication: Note on winning positions on pushdown games with \(\omega\)-regular conditions