{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:51Z","timestamp":1759639071211},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0304-3975(02)00027-0","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"555-608","source":"Crossref","is-referenced-by-count":29,"title":["L(A)=L(B)? A simplified decidability proof"],"prefix":"10.1016","volume":"281","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00027-0_BIB1","doi-asserted-by":"crossref","unstructured":"B. Courcelle, An axiomatic approach to the Korenjac\u2013Hopcroft algorithms, Math. Systems Theory (1983) 191\u2013231.","DOI":"10.1007\/BF01744577"},{"year":"1978","series-title":"Introduction to Formal Language Theory","author":"Harrison","key":"10.1016\/S0304-3975(02)00027-0_BIB2"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(79)90024-0","article-title":"On equivalence of grammars through transformation trees","volume":"9","author":"Harrison","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00027-0_BIB4","first-page":"14","article-title":"The equivalence problem for real-time strict deterministic pushdown automata","volume":"5","author":"Meitus","year":"1989","journal-title":"Kibernetika"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB5","first-page":"20","article-title":"Decidability of the equivalence problem for deterministic pushdown automata","volume":"5","author":"Meitus","year":"1992","journal-title":"Kibernetika"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB6","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/28869.28881","article-title":"The equivalence problem for real-time d.p.d.a's","volume":"34","author":"Oyamaguchi","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00027-0_BIB7","first-page":"13","article-title":"Equivalence problem for real-time deterministic pushdown automata","volume":"2","author":"Romanovskii","year":"1985","journal-title":"Kibernetika"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB8","first-page":"671","article-title":"The equivalence problem for deterministic pushdown automata is decidable","volume":"Vol. 1256","author":"S\u00e9nizergues","year":"1997"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB9","series-title":"Proc. FOCS\u201998","first-page":"120","article-title":"Decidability of bisimulation equivalence for equational graphs of finite out-degree","author":"S\u00e9nizergues","year":"1998"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB10","unstructured":"G. S\u00e9nizergues, T(A) =T(B)? in: Proc. ICALP 99, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 665\u2013675. Full proofs in Technical Report 1209-99 of LaBRI, T(A)=T(B)? pp. 1\u201361."},{"key":"10.1016\/S0304-3975(02)00027-0_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00285-1","article-title":"L(A)=L(B)? decidability results from complete formal systems","volume":"251","author":"S\u00e9nizergues","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00027-0_BIB12","doi-asserted-by":"crossref","unstructured":"C. Stirling, Decidability of dpda's equivalence, Technical Report, Edinburgh ECS-LFCS-99-411, 1999, pp. 1\u201325.","DOI":"10.1145\/333623.333624"},{"key":"10.1016\/S0304-3975(02)00027-0_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(00)00389-3","article-title":"Decidability of dpda's equivalence","volume":"255","author":"Stirling","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00027-0_BIB14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(74)90839-0","article-title":"The equivalence problem for deterministic finite-turn pushdown automata","volume":"25","author":"Valiant","year":"1974","journal-title":"Inform. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:27:05Z","timestamp":1556810825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0304397502000270"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00027-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}