{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:23:27Z","timestamp":1726410207208},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316050"},{"type":"electronic","value":"9783642316067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31606-7_29","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T07:47:55Z","timestamp":1345880875000},"page":"329-336","source":"Crossref","is-referenced-by-count":0,"title":["On Positive TAGED with a Bounded Number of Constraints"],"prefix":"10.1007","author":[{"given":"Pierre-Cyrille","family":"H\u00e9am","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Hugot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Kouchnarenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","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: LICS, pp. 263\u2013272. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.28"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-55210-3_181","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":"29_CR3","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Visibly tree automata with memory and constraints. CoRR abs\/0804.3065 (2008)","DOI":"10.2168\/LMCS-4(2:8)2008"},{"key":"29_CR4","unstructured":"Dauchet, M., Mongy, J.: Transformations de noyaux reconnaissables d\u2019arbres, For\u00eats RATEG. Ph.D. thesis, LIFL (France) (1981)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-85780-8_25","volume-title":"Developments in Language Theory","author":"E. Filiot","year":"2008","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)"},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905411000743X","volume":"21","author":"E. Filiot","year":"2010","unstructured":"Filiot, E., Talbot, J.-M., Tison, S.: Tree automata with global constraints. Int. J. Found. Comput. Sci.\u00a021(4), 571\u2013596 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"H\u00e9am, P.-C., Hugot, V., Kouchnarenko, O.: SAT solvers for queries over tree automata with constraints. In: ICST (CSTVA ws.), pp. 343\u2013348. IEEE (2010)","DOI":"10.1109\/ICSTW.2010.17"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Hosoya, H.: Foundations of XML Processing: The Tree-Automata Approach. Cambridge University Press (2010), \n                    \n                      http:\/\/books.google.fr\/books?id=xGlH3ADxwn4C","DOI":"10.1017\/CBO9780511762093"},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","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.\u00a0209(3), 486\u2013512 (2011)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31606-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:40:03Z","timestamp":1620128403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31606-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316050","9783642316067"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31606-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}