Note on winning positions on pushdown games with -regular conditions

DOI10.1016/S0020-0190(02)00445-3zbMATH Open1173.68558MaRDI QIDQ1007544FDOQ1007544

Authors: Olivier Serre 

Publication date: 23 March 2009

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

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• scientific article; zbMATH DE number 1948171
• Formats of winning strategies for six types of pushdown games
• Pushdown processes: Games and model-checking

zbMATH Keywords

automatagamesinfinite graphspushdown processes

Mathematics Subject Classification ID

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

Cites Work

• Alternation
• Title not available (Why is that?)
• Pushdown processes: Games and model-checking
• On the synthesis of strategies in infinite games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Title not available (Why is that?)
• The theory of ends, pushdown automata, and second-order logic
• Title not available (Why is that?)
• Uniform solution of parity games on prefix-recognizable graphs
• Title not available (Why is that?)

Cited In (16)

• Efficient CTL model-checking for pushdown systems
• A saturation method for the modal \(\mu \)-calculus over pushdown systems
• Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
• Regularity in PDA games revisited
• On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
• On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
• Omega-Regular Half-Positional Winning Conditions
• Games on Multi-stack Pushdown Systems
• Winning Regions of Pushdown Parity Games: A Saturation Method
• Efficient CTL model-checking for pushdown systems
• Regular strategies in pushdown reachability games
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computer Science Logic
• Games with winning conditions of high Borel complexity
• Regularity problems for weak pushdown \(\omega \)-automata and games

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

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