Counting branches in trees using games

DOI10.1016/j.ic.2016.11.005zbMath1357.68101arXiv1505.03852OpenAlexW2198382712MaRDI QIDQ729823

Arnaud Carayol, Olivier Serre

Publication date: 22 December 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.03852

zbMATH Keywords

two-player gamecardinality constraintautomaton on infinite treestopologically large set

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (1)

Monadic Second Order Logic with Measure and Category Quantifiers

Cites Work

• Borel determinacy
• Automata on infinite trees with counting constraints
• Randomization in Automata on Infinite Trees
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
• Banach-Mazur Games on Graphs
• Baire Category Quantifier in Monadic Second Order Logic
• Fair Adversaries and Randomization in Two-Player Games
• How Good Is a Strategy in a Game with Nature?
• Defining Fairness in Reactive and Concurrent Systems
• Decidability of Second-Order Theories and Automata on Infinite Trees
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting branches in trees using games