{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:28Z","timestamp":1725740368674},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_16","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"169-180","source":"Crossref","is-referenced-by-count":5,"title":["LALBLC A Program Testing the Equivalence of dpda\u2019s"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Henry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.tcs.2006.07.021","volume":"363","author":"C. Bastien","year":"2006","unstructured":"Bastien, C., Czyzowicz, J., Fraczak, W., Rytter, W.: Prime normal form and equivalence of simple grammars. TCS\u00a0363(2), 124\u2013134 (2006)","journal-title":"TCS"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-22993-0_20","volume-title":"Mathematical Foundations of Computer Science 2011","author":"S. B\u00f6hm","year":"2011","unstructured":"B\u00f6hm, S., G\u00f6ller, S.: Language equivalence of deterministic real-time one-counter automata is NL-complete. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 194\u2013205. Springer, Heidelberg (2011)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, S., G\u00f6ller, S., Jancar, P.: Equivalence of deterministic one-counter automata is NL-complete. CoRR, abs\/1301.2181 (2013)","DOI":"10.1145\/2488608.2488626"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-642-39212-2_15","volume-title":"ICALP 2013","author":"R. Chr\u00e9tien","year":"2013","unstructured":"Chr\u00e9tien, R., Cortier, V., Delaune, S.: From security protocols to pushdown automata. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 137\u2013149. Springer, Heidelberg (2013)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science\u00a025, 95\u2013169 (1983)","journal-title":"Theoretical Computer Science"},{"key":"16_CR6","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)"},{"key":"16_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":"Harrison, M.A., Havel, I.M., Yehudai, A.: On equivalence of grammars through transformation trees. TCS\u00a09, 173\u2013205 (1979)","journal-title":"TCS"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Jancar, P.: Decidability of dpda language equivalence via first-order grammars. In: LICS, pp. 415\u2013424 (2012)","DOI":"10.1109\/LICS.2012.51"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Meitus, Y.V.: The equivalence problem for real-time strict deterministic pushdown automata. In: Kibernetika 5, pp. 14\u201325 (1989) ( in Russian, english translation in Cybernetics and Systems analysis)","DOI":"10.1007\/BF01075213"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/11523468_74","volume-title":"Automata, Languages and Programming","author":"A.S. Murawski","year":"2005","unstructured":"Murawski, A.S., Ong, C.-H.L., Walukiewicz, I.: Idealized Algol with ground recursion, and DPDA equivalence. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 917\u2013929. Springer, Heidelberg (2005)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/3-540-63165-8_221","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"1997","unstructured":"S\u00e9nizergues, G.: The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 671\u2013681. Springer, Heidelberg (1997)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","volume":"251","author":"G. S\u00e9nizergues","year":"2001","unstructured":"S\u00e9nizergues, G.: L(A) = L(B)? decidability results from complete formal systems. Theoretical Computer Science\u00a0251, 1\u2013166 (2001)","journal-title":"Theoretical Computer Science"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45132-3_7","volume-title":"Machines, Computations, and Universality","author":"G. S\u00e9nizergues","year":"2001","unstructured":"S\u00e9nizergues, G.: Some applications of the decidability of dpda\u2019s equivalence. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 114\u2013132. Springer, Heidelberg (2001)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-45061-0_39","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"2003","unstructured":"S\u00e9nizergues, 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.\u00a02719, pp. 478\u2013489. Springer, Heidelberg (2003)"},{"issue":"5","key":"16_CR15","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1137\/S0097539700377256","volume":"34","author":"G. S\u00e9nizergues","year":"2005","unstructured":"S\u00e9nizergues, G.: The bisimulation problem for equational graphs of finite out-degree. SIAM J. Comput.\u00a034(5), 1025\u20131106 (2005) (electronic)","journal-title":"SIAM J. Comput."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/3-540-45465-9_70","volume-title":"Automata, Languages and Programming","author":"C. Stirling","year":"2002","unstructured":"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.\u00a02380, pp. 821\u2013832. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:48:43Z","timestamp":1558316923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}