Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Winning Regions of Higher-Order Pushdown Games
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Regular sets of higher-order pushdown stacks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Regular sets over extended tree structures
Theoretical Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Higher-order pushdown systems generalize pushdown systems by using higher-order stacks, which are nested stacks of stacks. In this article, we consider parity games defined by higher-order pushdown systems and provide a k-Exptimealgorithm to compute finite representations of positional winning strategies for both players for games defined by level-khigher-order pushdown automata. Our result is based on automata theoretic techniques exploiting the tree structure corresponding to higher-order stacks and their associated operations.