T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FOSSACS, LNCS 2303, 205--222, 2003. Springer. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Global Model-Checking of Infinite-State Systems - Piterman, Vardi (Correct)
No context found.
T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FOSSACS, LNCS 2303, 205--222, 2003. Springer.
Micro-Macro Stack Systems: A New Frontier of Elementary.. - Piterman, Vardi (Correct)
No context found.
T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FOSSACS, LNCS 2303, 205--222, 2003. Springer-Verlag.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC