{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:11:03Z","timestamp":1745208663853,"version":"3.40.4"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,8]],"date-time":"2012-11-08T00:00:00Z","timestamp":1352332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10817-012-9270-5","type":"journal-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T19:30:46Z","timestamp":1352316646000},"page":"371-400","source":"Crossref","is-referenced-by-count":1,"title":["Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints"],"prefix":"10.1007","volume":"51","author":[{"given":"Carles","family":"Creus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adri\u00e0","family":"Gasc\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,8]]},"reference":[{"key":"9270_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)"},{"key":"9270_CR2","doi-asserted-by":"crossref","unstructured":"Bargu\u00f1\u00f3, L., Creus, C., Godoy, G., Jacquemard, F., Vacher, C.: The emptiness problem for tree automata with global constraints. In: Logic in Computer Science (LICS), pp. 263\u2013272 (2010)","DOI":"10.1109\/LICS.2010.28"},{"key":"9270_CR3","doi-asserted-by":"crossref","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Symposium on Theoretical Aspects of Computer Science (STACS), pp. 161\u2013171 (1992)","DOI":"10.1007\/3-540-55210-3_181"},{"issue":"3","key":"9270_CR4","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1516512.1516515","volume":"56","author":"M Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3), 13:1\u201313:48 (2009)","journal-title":"J. ACM"},{"key":"9270_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). http:\/\/tata.gforge.inria.fr"},{"key":"9270_CR6","doi-asserted-by":"crossref","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility and automata with disequality constraints. In: Symposium on Theoretical Aspects of Computer Science (STACS), pp. 151\u2013162 (1994)","DOI":"10.1007\/3-540-57785-8_138"},{"key":"9270_CR7","doi-asserted-by":"crossref","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. In: Logic in Computer Science (LICS), pp. 26\u201334 (1997)","DOI":"10.1109\/LICS.1997.614922"},{"issue":"2","key":"9270_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jsco.1995.1048","volume":"20","author":"M Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.C., Coquid\u00e9, J.L.: Automata for reduction properties solving. J. Symbol. Comput. 20(2), 215\u2013233 (1995)","journal-title":"J. Symbol. Comput."},{"key":"9270_CR9","doi-asserted-by":"crossref","unstructured":"David, C., Libkin, L., Tan, T.: Efficient reasoning about data trees via integer linear programming. In: ICDT, pp. 18\u201329 (2011)","DOI":"10.1145\/1938551.1938558"},{"issue":"4","key":"9270_CR10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1142\/S012905411000743X","volume":"21","author":"E Filiot","year":"2010","unstructured":"Filiot, E., Talbot, J., Tison, S.: Tree automata with global constraints. Int. J. Found. Comput. Sci. 21(4), 571\u2013596 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"9270_CR11","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.ic.2010.11.015","volume":"209","author":"F Jacquemard","year":"2011","unstructured":"Jacquemard, F., Klay, F., Vacher, C.: Rigid tree automata and applications. Inf. Comput. 209(3), 486\u2013512 (2011)","journal-title":"Inf. Comput."},{"key":"9270_CR12","unstructured":"Mongy, J.: Transformation de noyaux reconnaissables d\u2019arbres. for\u00eats rateg. Ph.D. thesis, Laboratoire d\u2019Informatique Fondamentale de Lille, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d\u2019Ascq, France (1981)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-012-9270-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-012-9270-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-012-9270-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T11:48:50Z","timestamp":1745149730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-012-9270-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["9270"],"URL":"https:\/\/doi.org\/10.1007\/s10817-012-9270-5","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2012,11,8]]}}}