{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:06:48Z","timestamp":1648670808148},"reference-count":17,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1051\/ita\/2009006","type":"journal-article","created":{"date-parts":[[2009,3,11]],"date-time":"2009-03-11T12:19:27Z","timestamp":1236773967000},"page":"379-402","source":"Crossref","is-referenced-by-count":1,"title":["Nested Sibling Tree Automata"],"prefix":"10.1051","volume":"43","author":[{"given":"Fran\u00e7oise","family":"Gire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2009,3,12]]},"reference":[{"key":"R1","unstructured":"S. Abiteboul and P. Buneman,Data on the Web: From Relations to Semi-structured Data and XML(1999)."},{"key":"R2","unstructured":"R. Alur, S. Chaudhuri and P. Madhusudan, A fixpoint calculus for local and global program flows, Symposium on Principles of Programming Languages, POPL 2006 (2006) 153\u2013165."},{"key":"R3","unstructured":"R. Alur, S. Chaudhuri and P. Madhusudan, Languages of nested trees, Computer-Aided Verification, CAV 2006 (2006) 329\u2013342."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Rajeev Alur and P. Madhusudan, Visibly pushdown languages, Chicago, USA. 36th ACM symposium on Theory of Computing (2004) 202\u2013211.","DOI":"10.1145\/1007352.1007390"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"M. Bojanczyck and T. Colcombet, Tree-walking automata cannot be determinized. ICALP (2004) 246\u2013256.","DOI":"10.1007\/978-3-540-27836-8_23"},{"key":"R6","unstructured":"T. Bray, J.P. Paoh and C.M. Sperberg-McQueen, Extensible markup language (xml) 1.0, http:\/\/www.w3org\/TR\/1998\/REC-xml-19980210\/ (1998)."},{"key":"R7","unstructured":"A. Bruggemann, M. Murata and D. Wood,Regular tree and regular hedge languages over unranked alphabets, Technical Report 2001\u201305. HKUST TCS Center (1998)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.tcs.2004.09.036","volume":"331","author":"Comon","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"R9","unstructured":"H. Comon, M. Dauchet, R. Gilleron, C. L\u00f6ding, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi, Tree automata techniques and applications, available on: http:\/\/www.grappa.univ-lille3.fr\/tata (2007), release October, 12th (2007)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-71389-0_13","volume":"4423","author":"Comon-Lundh","year":"2007","journal-title":"Lect. Notes Comput. Sci."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"D. Lugiez and S. DalZilio,Xml schema, tree logic and sheaves automata, Technical Report RR-4631, Inria (2002).","DOI":"10.1007\/3-540-44881-0_18"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"F. Neven,Automata, logic and xml. CSL (2002) 2\u201326.","DOI":"10.1007\/3-540-45793-3_2"},{"key":"R13","unstructured":"C. Pitcher, Visibly pushdown expression effects for xml stream processing, Programming Languages Technologies for XML. PLAN-X (2005) 5\u201319."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"T. Schwentick,Tree, automata and xml. Paris, PODS (2004).","DOI":"10.1145\/1055558.1055589"},{"key":"R15","unstructured":"L. Segoufin,Typing and quering xml documents: some complexity bounds. San Diego CA, PODS (2003) 167\u2013178."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"H. Seidl, T. Schwentick and A. Muscholl,Numerical document queries. San Diego CA, PODS (2003).","DOI":"10.1145\/773153.773169"},{"key":"R17","unstructured":"J.W. Thatcher and J.B. Wright, Generalized finite automata with an application to a decision problem of second-order logic.Mathematical System Theory257\u201382 (1968)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2009006\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:15:58Z","timestamp":1558181758000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2009006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,12]]},"references-count":17,"journal-issue":{"issue":"2"},"alternative-id":["ita08026"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2009006","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,12]]}}}