{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:12:52Z","timestamp":1763388772946},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:16Z","timestamp":1330254976000},"page":"515-524","source":"Crossref","is-referenced-by-count":9,"title":["Complement problems and tree automata in AC-like theories (extended abstract)"],"prefix":"10.1007","author":[{"given":"D.","family":"Lugiez","sequence":"first","affiliation":[]},{"given":"J. L.","family":"Moysset","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proceedings of the 9th Symposium on Theoretical Computer Science, volume 577 of Lecture Notes in Computer Science, pages 161\u2013172, 1992.","DOI":"10.1007\/3-540-55210-3_181"},{"key":"51_CR2","volume-title":"Tree automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree automata. Akad\u00e9miai Kiad\u00f3, Budapest, Hungary, 1984."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"E. Kounalis, D. Lugiez, and L. Pottier. A solution of the complement problem in associative commutative theories. In A.Tarlecki, editor, 16th International Symposium Mathematical Foundation of Computer Sciences, volume 520 of Lecture Notes in Computer Science, pages 287\u2013297. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54345-7_72"},{"key":"51_CR4","unstructured":"D. Kapur, P. Narendran, D.J. Rosenkrantz, and H. Zhang. Sufficientcompleteness, quasi-reducibility and their complexity. Technical report, State University of New York at Albany, 1987."},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"D. Lugiez and J.L. Moysset. Complement problems and tree automata in ac-like theories. Technical Report 92-R-175, CRIN, 1992.","DOI":"10.1007\/3-540-56503-5_51"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Ralf Treinen. A new method for undecidability proofs of first order theories. In K. V. Nori and C. E. Veni Madhavan, editors, Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, pages 48\u201362. Springer Lecture Notes in Computer Science, vol. 472, 1990.","DOI":"10.1007\/3-540-53487-3_34"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:04:25Z","timestamp":1605647065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}