Solving Infinite Games in the Baire Space
From MaRDI portal
Publication:5038566
DOI10.3233/FI-222119MaRDI QIDQ5038566
Benedikt Brütsch, Wolfgang Thomas
Publication date: 7 October 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.10881
monadic second-order logicinfinite gamesdeterminacytransducerspushdown systemsGale-Stewart gamesChurch's synthesis problemautomata over infinite alphabets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Choice functions and well-orderings over the infinite binary tree
- Games with winning conditions of high Borel complexity
- Borel determinacy
- Finite-memory automata
- Borel hierarchy and omega context free languages.
- On the transition graphs of Turing machines.
- Monadic second-order logic on tree-like structures
- Automata, logics, and infinite games. A guide to current research
- Automata theory in nominal sets
- The Determinacy of Context-Free Games
- Two-variable logic on data words
- An Automata Model for Trees with Ordered Data Values
- Regular Strategies in Pushdown Reachability Games
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
- An Automata-Theoretic Approach to Infinite-State Systems
- Solving Sequential Conditions by Finite-State Strategies
- Decision problems forω-automata
- Decidability of Second-Order Theories and Automata on Infinite Trees
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$
This page was built for publication: Solving Infinite Games in the Baire Space
