Two-Way Tree Automata Solving Pushdown Games

DOI10.1007/3-540-36387-4_17zbMATH Open1021.68044OpenAlexW2180049245MaRDI QIDQ4412840FDOQ4412840

Authors: Thierry Cachat 

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_17

Recommendations

• Formats of winning strategies for six types of pushdown games
• Winning Regions of Pushdown Parity Games: A Saturation Method
• scientific article; zbMATH DE number 2038738
• scientific article; zbMATH DE number 2086664
• Pushdown processes: Games and model-checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 2-person games (91A05) Games involving graphs (91A43)

Cited In (16)

• Collapsible pushdown parity games
• Church synthesis on register automata over linearly ordered data domains
• Positional Strategies for Higher-Order Pushdown Parity Games
• Title not available (Why is that?)
• Fundamentals of Computation Theory
• The complexity of flat freeze LTL
• The complexity of flat freeze LTL
• Games on Multi-stack Pushdown Systems
• Uniform solution of parity games on prefix-recognizable graphs
• Perspective games
• Pushdown module checking
• Evaluating Datalog via tree automata and cycluits
• Formats of winning strategies for six types of pushdown games
• Computer Science Logic
• Playing pushdown parity games in a hurry
• Title not available (Why is that?)

This page was built for publication: Two-Way Tree Automata Solving Pushdown Games

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