{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:59:15Z","timestamp":1773655155433,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631651","type":"print"},{"value":"9783540691945","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_221","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:12:23Z","timestamp":1330279943000},"page":"671-681","source":"Crossref","is-referenced-by-count":55,"title":["The equivalence problem for deterministic pushdown automata is decidable"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"C. Beeri. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305\u2013320, 1976.","DOI":"10.1016\/0304-3975(76)90049-9"},{"key":"63_CR2","first-page":"1","volume":"53","author":"D. Caucal","year":"1995","unstructured":"D. Caucal. Bisimulation of context-free grammars and of pushdown automata. To appear in CSLI, Modal Logic and process algebra, vol. 53, Stanford, pages 1\u201320, 1995.","journal-title":"To appear in CSLI, Modal Logic and process algebra"},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"B. Courcelle. An axiomatic approach to the Korenjac-Hopcroft algorithms. Math. Systems theory, pages 191\u2013231, 1983.","DOI":"10.1007\/BF01744577"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Recursive applicative program schemes. In Handbook of THeoretical Computer Science. edited by J. Van Leeuwen, pages 461\u2013490. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"63_CR5","doi-asserted-by":"crossref","unstructured":"S. Ginsburg and S. Greibaxch. Deterministic context-free languages. Information and Control, pages 620\u2013648, 1966.","DOI":"10.1016\/S0019-9958(66)80019-0"},{"key":"63_CR6","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978."},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(79)90024-0","volume":"9","author":"M.A. Harrison","year":"1979","unstructured":"M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173\u2013205, 1979.","journal-title":"TCS"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"L.P. Lisovik. Hard sets methods and semilinear reservoir method with applications. In Proceedings 23rd ICALP, pages 229\u2013231. Springer, LNCS 1099, 1996.","DOI":"10.1007\/3-540-61440-0_130"},{"key":"63_CR9","first-page":"14","volume":"5","author":"Y.V. Meitus","year":"1989","unstructured":"Y.V. Meitus. The equivalence problem for real-time strict deterministic pushdown automata. Kibernetika 5 (in russian, english translation in Cybernetics and Systems analysis), pages 14\u201325, 1989.","journal-title":"Kibernetika"},{"key":"63_CR10","first-page":"20","volume":"5","author":"Y.V. Meitus","year":"1992","unstructured":"Y.V. Meitus. Decidability of the equivalence problem for deterministic pushdown automata. Kibernetika 5 (in russian, english translation in Cybernetics and Systems analysis), pages 20\u201345, 1992.","journal-title":"Kibernetika"},{"key":"63_CR11","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/28869.28881","volume":"34","author":"M. Oyamaguchi","year":"1987","unstructured":"M. Oyamaguchi. The equivalence problem for real-time d.p.d.a's. J. assoc. Comput. Mach. 34, pages 731\u2013760, 1987.","journal-title":"J. assoc. Comput. Mach."},{"key":"63_CR12","first-page":"13","volume":"no 2","author":"V. Romanovskii","year":"1985","unstructured":"V.Yu. Romanovskii. Equivalence problem for real-time deterministic pushdown automata. Kibernetika no 2, pages 13\u201323, 1985.","journal-title":"Kibernetika"},{"key":"63_CR13","doi-asserted-by":"crossref","unstructured":"G. S\u00e9niaergues. Formal languages and word-rewriting. In Term Rewriting, Advanced Course, pages 75\u201394. Springer, LNCS 909, edited by H. Comon and J.P.Jouannaud, 1994.","DOI":"10.1007\/3-540-59340-3_7"},{"key":"63_CR14","unstructured":"G. S\u00e9nizergues. L(A)=L(B)? Technical report, LaBRI, Universit\u00e9 Bordeaux I, report nr1161-97. can be accessed at URL, http:\/\/www.labri.u-bordeaux.fr\/, 1997."},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. In Proceedings CONCUR 96, 1996.","DOI":"10.1007\/3-540-61604-7_57"},{"key":"63_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","volume":"25","author":"L.G. Valiant","year":"1974","unstructured":"L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123\u2013133, 1974.","journal-title":"Information and Control"},{"key":"63_CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/S0022-0000(75)80005-5","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"L.G. Valiant and M.S. Paterson. Deterministic one-counter automata. Journal of Computer and System Sciences 10. pages 340\u2013350, 1975.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_221.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:16:31Z","timestamp":1605629791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_221","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}