Alternating Tree Automata and Parity Games

DOI10.1007/3-540-36387-4_9MaRDI QIDQ4412832zbMATH OpenOpenAlexFDO

Authors Daniel Kirsten

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Word problems, etc. in computability and recursion theory (03D40) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Alternating tree automata, parity games, and modal -calculus
• Alternating tree automata
• Parity games and automata for game logic
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• Alternating automata on infinite trees
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 4083011
• scientific article; zbMATH DE number 168434
• scientific article; zbMATH DE number 7447732
• Simulation Relations for Alternating Parity Automata and Parity Games

Cited in

(15)

• Alternating tree automata
• Parity games and automata for game logic
• The finite graph problem for two-way alternating automata.
• The computational complexity of scenario-based agent verification and design
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• scientific article; zbMATH DE number 7447732 (Why is no real title available?)
• Simulation Relations for Alternating Parity Automata and Parity Games
• scientific article; zbMATH DE number 4051592 (Why is no real title available?)
• scientific article; zbMATH DE number 1931697 (Why is no real title available?)
• On the Way to Alternating Weak Automata
• Register games
• Fundamentals of Computation Theory
• Alternating weak automata from universal trees
• Alternating tree automata, parity games, and modal -calculus
• A survey on satisfiability checking for the \(\mu \)-calculus through tree automata

This page was built for publication: Alternating Tree Automata and Parity Games

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