Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. STOC 2004, pp. 202–211. ACM (2004)
2. Benedikt, M., Göller, S., Kiefer, S., Murawski, A.S.: Bisimilarity of pushdown automata is nonelementary. In: Proc. LICS 2013, pp. 488–498. IEEE Computer Society (2013)
3. Böhm, S., Göller, S., Jančar, P.: Equivalence of deterministic one-counter automata is NL-complete. In: Proc. STOC 2013, pp. 131–140. ACM (2013)
4. Böhm, S., Göller, S., Jančar, P.: Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80, 720–743 (2014),
http://dx.doi.org/10.1016/j.jcss.2013.11.003
5. Broadbent, C.H., Göller, S.: On bisimilarity of higher-order pushdown automata: Undecidability at order two. In: FSTTCS 2012. LIPIcs, vol. 18, pp. 160–172. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献