## Abstract

We investigate the determinacy strength of infinite games whose winning sets are recognized by nondeterministic pushdown automata with various acceptance conditions, e.g., safety, reachability and co-Büchi conditions. In terms of the foundational program "Reverse Mathematics", the determinacy strength of such games is measured by the complexity of a winning strategy required by the determinacy. Infinite games recognized by nondeterministic pushdown automata have some resemblance to those by deterministic 2-stack visibly pushdown automata with the same acceptance conditions. So, we first investigate the determinacy of games recognized by deterministic 2-stack visibly pushdown automata, together with that by nondeterministic ones. Then, for instance, we prove that the determinacy of games recognized by pushdown automata with a reachability condition is equivalent to the weak König lemma, stating that every infinite binary tree has an infinite path. While the determinacy for pushdown ω-languages with a Büchi condition is known to be independent from ZFC, we here show that for the co-Büchi condition, the determinacy is exactly captured by ATR_{0}, another popular system of reverse mathematics asserting the existence of a transfinite hierarchy produced by iterating arithmetical comprehension along a given well-order. Finally, we conclude that all results for pushdown automata in this paper indeed hold for 1-counter automata.

Original language | English |
---|---|

Pages (from-to) | 29-50 |

Number of pages | 22 |

Journal | RAIRO - Theoretical Informatics and Applications |

Volume | 51 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2017 Jan 1 |

## Keywords

- 2-stack visibly pushdown automata
- Gale-Stewart games
- Pushdown ω-languages
- Reverse mathematics

## ASJC Scopus subject areas

- Software
- Mathematics(all)
- Computer Science Applications