Author:
Knapik Teodor,Niwiński Damian,Urzyczyn Paweł,Walukiewicz Igor
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Lecture Notes in Computer Science;K. Aehlig,2005
2. Lecture Notes in Computer Science;K. Aehlig,2005
3. Lecture Notes in Computer Science;T. Cachat,2003
4. Cachat, T., Walukiewicz, I.: The complexity of games on higher order pushdown automata, (2004) (manuscript)
5. Lecture Notes in Computer Science;D. Caucal,2002
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Collapsible Pushdown Parity Games;ACM Transactions on Computational Logic;2021-06-24
2. Collapsible Pushdown Automata and Recursion Schemes;ACM Transactions on Computational Logic;2017-07-31
3. Unboundedness and downward closures of higher-order pushdown automata;ACM SIGPLAN Notices;2016-04-08
4. Unboundedness and downward closures of higher-order pushdown automata;Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2016-01-11
5. Simply typed fixpoint calculus and collapsible pushdown automata;Mathematical Structures in Computer Science;2015-03-18