Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
From MaRDI portal
Publication:2963922
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)
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)