{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:06:22Z","timestamp":1743098782181,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_25","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"314-326","source":"Crossref","is-referenced-by-count":10,"title":["Tree Automata with Global Constraints"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Tison","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1006\/inco.1995.1139","volume":"122","author":"A. Aiken","year":"1995","unstructured":"Aiken, A., Kozen, D., Wimmers, E.L.: Decidability of systems of set constraints with negative constraints. Information and Computation\u00a0122(1), 30\u201344 (1995)","journal-title":"Information and Computation"},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.02.004","volume":"94","author":"S. Anantharaman","year":"2005","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett.\u00a094(5), 231\u2013240 (2005)","journal-title":"Inf. Process. Lett."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"STACS 92","author":"B. Bogaert","year":"1992","unstructured":"Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 161\u2013171. Springer, Heidelberg (1992)"},{"key":"25_CR4","unstructured":"Charatonik, W.: Automata on dag representations of finite trees. Technical report (1999)"},{"key":"25_CR5","unstructured":"Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: IEEE Symposium on Foundations of Computer Science (1994)"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"H. Comon","year":"2005","unstructured":"Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. TCS\u00a0331(1), 143\u2013214 (2005)","journal-title":"TCS"},{"key":"25_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1994.1056","volume":"112","author":"H. Comon","year":"1994","unstructured":"Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation\u00a0112(2), 167\u2013216 (1994)","journal-title":"Information and Computation"},{"key":"25_CR9","first-page":"215","volume":"20","author":"M. Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.-C., Coquid\u00e9, J.-L.: Reduction properties and automata with constraints. JSC\u00a020, 215\u2013233 (1995)","journal-title":"JSC"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74915-8_13","volume-title":"Computer Science Logic","author":"E. Filiot","year":"2007","unstructured":"Filiot, E., Talbot, J.-M., Tison, S.: Satisfiability of a spatial logic with tree variables. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 130\u2013145. Springer, Heidelberg (2007)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Gilleron, R., Tison, S., Tommasi, M.: Some new decidability results on positive and negative set constraints. In: Proceedings of the International Conference on Constraints in Computational Logics, pp. 336\u2013351 (1994)","DOI":"10.1007\/BFb0016864"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Research Report, LSV, ENS Cachan (2006)","DOI":"10.1007\/11814771_45"},{"key":"25_CR13","unstructured":"Karianto, W., L\u00f6ding, C.: Unranked tree automata with sibling equalities and disequalities. Research Report, RWTH Aachen (2006)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71316-6_9","volume-title":"Programming Languages and Systems","author":"C. Kirchner","year":"2007","unstructured":"Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-pattern matching. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421. Springer, Heidelberg (2007)"},{"key":"25_CR15","unstructured":"Kutsia, T., Marin, M.: Solving regular constraints for hedges and contexts. In: UNIF 2006, pp. 89\u2013107 (2006)"},{"issue":"2","key":"25_CR16","first-page":"1","volume":"3","author":"L. Libkin","year":"2006","unstructured":"Libkin, L.: Logics over unranked trees: an overview. LMCS 2006\u00a03(2), 1\u201331 (2006)","journal-title":"LMCS 2006"},{"key":"25_CR17","unstructured":"Mongy, J.: Transformation de noyaux reconnaissables d\u2019arbres. For\u00eats RATEG. PhD thesis, Universit\u00e9 de Lille (1981)"},{"key":"25_CR18","unstructured":"Murata, M.: Hedge automata: A formal model for xml schemata. Technical report, Fuji Xerox Information Systems (1999)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45793-3_2","volume-title":"Computer Science Logic","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 2\u201326. Springer, Heidelberg (2002)"},{"issue":"3","key":"25_CR20","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML \u2013 a survey. J. Comput. Syst. Sci.\u00a073(3), 289\u2013315 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR21","unstructured":"Stefansson, K.: Systems of set constraints with negative constraints are nexptime-complete. In: LICS (1994)"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory\u00a02, 57\u201382 (1968)","journal-title":"Mathematical System Theory"},{"key":"25_CR23","unstructured":"Full paper version, \n                      http:\/\/hal.inria.fr\/inria-00292027"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T13:33:40Z","timestamp":1675085620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}