{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:08:25Z","timestamp":1740632905988,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_41","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"581-593","source":"Crossref","is-referenced-by-count":4,"title":["Bottom-Up Tree Automata with Term Constraints"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Reu\u00df","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Bargu\u00f1o, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: The emptiness problem for tree automata with global constraints. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), Edinburgh, Scotland, UK, July 2010. IEEE Computer Society Press, Los Alamitos (2010), http:\/\/www.lsv.ens-cachan.fr\/Publis\/PAPERS\/PDF\/BCGJV-lics10.pdf (to appear)","DOI":"10.1109\/LICS.2010.28"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: STACS 1992: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, London, UK, pp. 161\u2013171. Springer, Heidelberg (1992) ISBN 3-540-55210-3","DOI":"10.1007\/3-540-55210-3_181"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/3-540-58201-0_88","volume-title":"Automata, Languages, and Programming","author":"A.-C. Caron","year":"1994","unstructured":"Caron, A.-C., Comon, H., Coquid\u00e9, J.-L., Dauchet, M., Jacquemard, F.: Pumping, cleaning and symbolic constraints solving. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 436\u2013449. Springer, Heidelberg (1994), ISBN 3-540-58201-0"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-56868-9_25","volume-title":"Rewriting Techniques and Applications","author":"A.-C. Caron","year":"1993","unstructured":"Caron, A.-C., Coquid\u00e9, J.-L., Dauchet, M.: Encompassment properties and automata with constraints. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 328\u2013342. Springer, Heidelberg (1993), ISBN 3-540-56868-9"},{"key":"41_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata (release October 12, 2007)"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is exptime-complete. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, p. 26. IEEE Computer Society, Los Alamitos (1997) ISBN 0-8186-7925-5","DOI":"10.1109\/LICS.1997.614922"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-57785-8_138","volume-title":"STACS 94","author":"H. Comon","year":"1994","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility and automata with disequality constraints. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 151\u2013162. Springer, Heidelberg (1994), ISBN 3-540-57785-8"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Filiot, E., Talbot, J.-M., Tison, S.: Tree automata with global constraints. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 314\u2013326. Springer, Heidelberg (2008), ISBN 978-3-540-85779-2, doi: http:\/\/dx.doi.org\/10.1007\/978-3-540-85780-8_25 .","DOI":"10.1007\/978-3-540-85780-8_25"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.W., Shapiro, E.Y., Vardi, M.Y., Yardeni, E.: Logic programs as types for logic programs. In: LICS, pp. 300\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Godoy, G., Gim\u00e9nez, O., Ramos, L., \u00c0lvarez, C.: The hom problem is decidable. In: STOC, pp. 485\u2013494 (2010)","DOI":"10.1145\/1806689.1806757"},{"key":"41_CR11","unstructured":"L\u00f6ding, C., Wong, K.: On nondeterministic unranked tree automata with sibling constraints. In: FSTTCS, pp. 311\u2013322 (2009)"},{"key":"41_CR12","unstructured":"Mongy, J.: Transformation de noyaux reconnaissables d\u2019arbres. PhD thesis, Laboratoire d\u2019Informatique Fondamentale de Lille, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d\u2019Ascq, France (1981)"},{"key":"41_CR13","unstructured":"Tommasi, M.: Automates d\u2019arbres avec tests d\u2019\u00e9galit\u00e9 entre cousins germains. M\u00e9moire de DEA, Univ. Lille I (1992)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:10Z","timestamp":1740547990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}