Emptiness Of Alternating Tree Automata Using Games With Imperfect Information

DOI10.4230/LIPICS.FSTTCS.2013.299MaRDI QIDQ2963922zbMATH OpenOpenAlexFDO

Authors Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre

Publication date 21 February 2017

Full work available at URL https://hal.inria.fr/hal-01260682

zbMATH Keywords

two-player gamesalternating automataemptiness checkingimperfect information games

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80) Games involving graphs (91A43)

Recommendations

• Alternating Tree Automata and Parity Games
• scientific article; zbMATH DE number 1775458
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
• scientific article; zbMATH DE number 4051592
• A note on the emptiness problem for alternating finite-memory automata
• scientific article; zbMATH DE number 168434
• The ground tree transducer game with identical tree automata
• Fundamentals of Computation Theory
• Emptiness and finiteness for tree automata with global reflexive disequality constraints

Cited in

(6)

• Multi-player games with LDL goals over finite traces
• Counting branches in trees using games
• Alternating Tree Automata and Parity Games
• VLDL satisfiability and model checking via tree automata
• Alternating nonzero automata
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: Emptiness Of Alternating Tree Automata Using Games With Imperfect Information

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