Alternating Tree Automata and Parity Games
From MaRDI portal
Publication:4412832
DOI10.1007/3-540-36387-4_9zbMath1021.03030OpenAlexW1508959586MaRDI QIDQ4412832
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36387-4_9
2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40)
Related Items (3)
The computational complexity of scenario-based agent verification and design ⋮ Unnamed Item ⋮ On the Way to Alternating Weak Automata
This page was built for publication: Alternating Tree Automata and Parity Games
