Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Maths. Soc. 141, 1–35 (1969)
2. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science 37, 51–75 (1985)
3. Lecture Notes in Computer Science;D. Caucal,1996
4. Stirling, C.: Decidability of bisimulation equivalence for pushdown processes (2000) (submitted for publication)
5. Lecture Notes in Computer Science;T. Knapik,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Payoffs, Intensionality and Abstraction in Games;Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky;2013