Language equivalence of deterministic real-time one-counter automata is NL-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6907 LNCS, Issue , 2011, Pages 194-205

  Böhm, Stanislav ^a   Göller, Stefan ^b  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC PUSHDOWN AUTOMATA; EQUIVALENCE PROBLEM; INCLUSION PROBLEM;

COMPUTER SCIENCE; EQUIVALENCE CLASSES;

AUTOMATA THEORY;

EID: 80052113443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_20     Document Type: Conference Paper

References (24)

1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC, pp. 202-211. ACM, New York (2004)
2. Berman, P., Roos, R.: Learning One-Counter Languages in Polynomial Time (Extended Abstract). In: Proc. of FOCS, pp. 61-67. IEEE, Los Alamitos (1987)
3. Böhm, S., Göller, S., Jančar, P.: Bisimilarity of one-counter processes is PSPACE-complete. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 177-191. Springer, Heidelberg (2010)
4. Caucal, D.: Synchronization of Pushdown Automata. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 120-132. Springer, Heidelberg (2006)
5. Fahmy, A.F., Roos, R.S.: Efficient Learning of Real Time One-Counter Automata. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS, vol. 997, pp. 25-40. Springer, Heidelberg (1995)
6. Friedman, E.P.: The inclusion problem for simple languages. Theor. Comput. Sci. 1(4), 297-316 (1976)
7. Higuchi, K., Wakatsuki, M., Tomita, E.: A polynomial-time algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by final state. IEICE Trans. Information and Systems E78-D, 939-950 (1995)
8. Higuchi, K., Wakatsuki, M., Tomita, E.: A polynomial-time algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by accept mode. IEICE Trans. Information and Systems E81-D, 1-11 (1998)
9. Hirshfeld, Y., Jerrum, M., Moller, F.: A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci. 158(1&2), 143-159 (1996)
10. Immerman, N.: Nondeterministic Space is Closed Under Complementation. SIAM J. Comput. 17(5), 935-938 (1988)
11. Jančar, P.: Decidability of bisimilarity for one-counter processes. Information Computation 158(1), 1-17 (2000)
12. Jančar, P., Kučera, A., Moller, F.: Simulation and bisimulation over one-counter processes. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 334-345. Springer, Heidelberg (2000)
13. Jančar, P., Kučera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. Inf. Comput. 188(1), 1-19 (2004)
14. Jančar, P., Moller, F., Sawa, Z.: Simulation Problems for One-Counter Machines. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM1999. LNCS, vol. 1725, pp. 404-413. Springer, Heidelberg (1999)
15. Mayr, R.: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 570-583. Springer, Heidelberg (2003)
16. Minsky, M.L.: Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines. Annals of Mathematics. Second Series 74, 437-455 (1961)
17. Nowotka, D., Srba, J.: Height-Deterministic Pushdown Automata. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 125-134. Springer, Heidelberg (2007)
18. Oyamaguchi, M.: The equivalence problem for real-time DPDAs. J. ACM 34, 731-760 (1987)
19. Roos, R.: Deciding Equivalence of Deterministic One-Counter Automata in Polynomial Time with Applications to Learning. PhD thesis, The Pennsylvania State University (1988)
20. Sénizergues, G.: L(A)=L(B)? decidability results from complete formal systems. Theor. Comput. Sci. 251(1-2), 1-166 (2001)
21. Sénizergues, G.: L(A)=L(B)? A simplified decidability proof. Theor. Comput. Sci. 281(1-2), 555-608 (2002)
22. Sénizergues, G.: The Equivalence Problem for t-Turn DPDA Is Co-NP. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 478-489. Springer, Heidelberg (2003)
23. Stirling, C.: Deciding DPDA Equivalence Is Primitive Recursive. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 821-832. Springer, Heidelberg (2002)
24. Valiant, L.G., Paterson, M.: Deterministic one-counter automata. J. Comput. Syst. Sci. 10(3), 340-350 (1975)