{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:58Z","timestamp":1761611218032,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_63","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"665-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["T(A) = T(B)?"],"prefix":"10.1007","author":[{"given":"G\u00e9raud","family":"S\u00e9nizergues","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"63_CR1","unstructured":"J. Berstel and C. Reutenauer. Rational Series and their Languages. Springer, 1988."},{"key":"63_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-15983-5","volume-title":"Proceedings 1st RTA","author":"B. Buchberger","year":"1985","unstructured":"B. Buchberger. Basic features and development of the critical-pair\/completion algorithm. In Proceedings 1st RTA, pages 1\u201345. LNCS 202, 1985."},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"K. CulikII and J. Karhum\u00e4ki. The equivalence of finite-valued transducers (on HDT0L languages) is decidable. Theoretical Computer Science, pages 71\u201384, 1986.","DOI":"10.1016\/0304-3975(86)90134-9"},{"key":"63_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF00288472","volume":"23","author":"K. Culik II","year":"1986","unstructured":"K. CulikII and J. Karhum\u00e4ki. Synchronizable deterministic pushdown automata and the decidability of their equivalence. Acta Informatica 23, pages 597\u2013605, 1986.","journal-title":"Acta Informatica"},{"key":"63_CR5","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_CR6","doi-asserted-by":"crossref","unstructured":"K. CulikII. New techniques for proving the decidability of equivalence problems. Theoretical Computer Science, pages 29\u201345, 1990.","DOI":"10.1016\/0304-3975(90)90189-O"},{"key":"63_CR7","unstructured":"V.S. Guba. A solution of Ehrenfeucht\u2019s conjecture. unpublished note, 1985."},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0020-0190(81)90116-2","volume":"13","author":"O.H. Ibarra","year":"1981","unstructured":"O.H. Ibarra and L. Rosier. On the decidability of equivalence problem for deterministic pushdown transducers. Information Processing Letters 13, pages 89\u201393, 1981.","journal-title":"Information Processing Letters"},{"key":"63_CR9","series-title":"Lect Notes Comput Sci","first-page":"229","volume-title":"Proceedings 23rd ICALP","author":"L.P. Lisovik","year":"1996","unstructured":"L.P. Lisovik. Hard sets methods and semilinear reservoir method with applications. In Proceedings 23rd ICALP, pages 229\u2013231. Springer, LNCS 1099, 1996."},{"key":"63_CR10","unstructured":"R.C. Lyndon and P.E. Schupp. Combinatorial Group Theory. Springer Verlag, 1977."},{"key":"63_CR11","doi-asserted-by":"crossref","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.","DOI":"10.1007\/BF01075213"},{"key":"63_CR12","volume-title":"The Mathematical Theory of L-systems","author":"G. Rozenberg","year":"1980","unstructured":"G. Rozenberg and A. Salomaa. The Mathematical Theory of L-systems. Academic Press, New-York, 1980."},{"key":"63_CR13","doi-asserted-by":"crossref","unstructured":"G. S\u00e9nizergues. L(A) = L(B)? In Proceedings INFINITY 97, pages 1\u201326. Electronic Notes in Theoretical Computer Science 9, URL: http:\/\/www.elsevier.nl\/locate\/entcs\/volume9.html, 1997.","DOI":"10.1016\/S1571-0661(05)80430-X"},{"key":"63_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BFb0055780","volume-title":"Proceedings MFCS\u201998","author":"G. S\u00e9nizergues","year":"1998","unstructured":"G. S\u00e9nizergues. The equivalence problem for deterministic pushdown transducers into abelian groups. In Proceedings MFCS\u201998, pages 305\u2013315. Springer, LNCS 1450, 1998."},{"key":"63_CR15","unstructured":"G. S\u00e9nizergues. L(A) = L(B)? Technical report, LaBRI, Universit\u00e9 Bordeaux I, 1998. Improved version of report 1161-97, submitted to TCS, accessible at URL, http:\/\/www.labri.u-bordeaux.fr\/_ges, pages 1\u2013166, april 1998."},{"key":"63_CR16","unstructured":"G. S\u00e9nizergues. T(A) = T(B)? Technical report, nr 1209-99, LaBRI, 1999. Pages 1\u201361. Can be accessed at URL, http:\/\/www.labri.u-bordeaux.fr\/_ges."},{"key":"63_CR17","doi-asserted-by":"crossref","unstructured":"E. Tomita and K. Seino. A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict. Theoretical Computer Science, pages 39\u201353, 1989.","DOI":"10.1016\/0304-3975(89)90096-0"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:11:34Z","timestamp":1642821094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}