Equivalence of deterministic one-counter automata is NL-complete

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 131-140

  Böhm, Stanislav ^a   Göller, Stefan ^b   Jančar, Petr ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

Computational complexity; Deterministic one counter automata; Language equivalence

Indexed keywords

DETERMINISTIC ONE-COUNTER AUTOMATA; LANGUAGE EQUIVALENCE; TIME COMPLEXITY; UPPER BOUND;

COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES;

AUTOMATA THEORY;

EID: 84879825745     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488626     Document Type: Conference Paper

References (18)

1. P. Berman and R. Roos. Learning One-Counter Languages in Polynomial Time (Extended Abstract). In Proc. of FOCS, pages 61-67. IEEE, 1987.
2. S. Böhm and S. Göller. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. In Proc. of MFCS, volume 6907 of Lecture Notes in Computer Science, pages 194-205. Springer, 2011.
3. S. Böhm, S. Göller, and P. Jančar. Bisimilarity of one-counter processes is PSPACE-complete. In Proc. of CONCUR, volume 6269 of Lecture Notes in Computer Science, pages 177-191. Springer, 2010.
4. W. Czerwiński and S. Lasota. Fast equivalence-checking for normed context-free processes. In Proc. FSTTCS'10, volume 8 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.
5. A. F. Fahmy and R. S. Roos. Efficient Learning of Real Time One-Counter Automata. In Proc. of ALT, volume 997 of Lecture Notes in Computer Science, pages 25-40. Springer, 1995.
6. K. Higuchi, M. Wakatsuki, and E. Tomita. 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.
7. K. Higuchi, M. Wakatsuki, and E. Tomita. 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.
8. Y. Hirshfeld, M. Jerrum, and F. Moller. A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Theor. Comput. Sci., 158(1&2):143-159, 1996.
9. P. Jančar. Decidability of dpda language equivalence via first-order grammars. In Proc. of LICS, pages 415-424. IEEE, 2012.
10. P. Jančar, A. Kučera, and F. Moller. Simulation and bisimulation over one-counter processes. In Proc. of STACS, volume 1770 of Lecture Notes in Computer Science, pages 334-345, 2000.
11. R. Mayr. Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. In Proc. of ICALP, volume 2719 of Lecture Notes in Computer Science, pages 570-583, 2003.
12. M. Oyamaguchi. The equivalence problem for real-time DPDAs. J. ACM, 34:731-760, 1987.
13. R. Roos. Deciding Equivalence of Deterministic One-Counter Automata in Polynomial Time with Applications to Learning. PhD thesis, The Pennsylvania State University, 1988.
14. G. Sénizergues. L(A)=L(B)? decidability results from complete formal systems. Theor. Comput. Sci., 251(1-2):1-166, 2001.
15. G. Sénizergues. L(A)=L(B)? A simplified decidability proof. Theor. Comput. Sci., 281(1-2):555-608, 2002.
16. G. Sénizergues. The Equivalence Problem for t-Turn DPDA Is Co-NP. In Proc. of ICALP, volume 2719 of Lecture Notes in Computer Science, pages 478-489. Springer, 2003.
17. C. Stirling. Deciding DPDA Equivalence Is Primitive Recursive. In Proc. of ICALP, volume 2380 of Lecture Notes in Computer Science, pages 821-832. Springer, 2002.
18. L. G. Valiant and M. Paterson. Deterministic one-counter automata. J. Comput. Syst. Sci., 10(3):340-350, 1975.