Topological extension of parity automata
From MaRDI portal
Publication:388217
DOI10.1016/J.IC.2013.06.004zbMath1358.03048OpenAlexW2018046569MaRDI QIDQ388217
Publication date: 19 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.06.004
Formal languages and automata (68Q45) Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- The strict determinateness of certain infinite games
- Borel determinacy
- On the Borel Complexity of MSO Definable Sets of Branches
- State-strategies for games in Fσδ ∩ Gδσ
- Positional Determinacy of Games with Infinitely Many Priorities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Topological extension of parity automata