{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:45:05Z","timestamp":1743104705199,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029783"},{"type":"electronic","value":"9783642029790"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02979-0_13","type":"book-chapter","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T08:16:20Z","timestamp":1246868180000},"page":"94-104","source":"Crossref","is-referenced-by-count":0,"title":["Compact Representation for Answer Sets of n-ary Regular Queries"],"prefix":"10.1007","author":[{"given":"Kazuhiro","family":"Inaba","sequence":"first","affiliation":[]},{"given":"Haruo","family":"Hosoya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1017\/S0956796802004410","volume":"13","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. Journal of Functional Programming\u00a013, 961\u20131004 (2003)","journal-title":"Journal of Functional Programming"},{"key":"13_CR2","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 theory with an application to a decision problem of second-order logic. Mathematical Systems Theory\u00a02, 57\u2013811 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Niwinski, D.: Fixed points vs. infinite generation. In: LICS, pp. 402\u2013409 (1988)","DOI":"10.1109\/LICS.1988.5137"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G. Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems\u00a030, 444\u2013491 (2005)","journal-title":"ACM Transactions on Database Systems"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/962446.962450","volume":"51","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Koch, C.: Monadic datalog and the expressive power of languages for Web information extraction. Journal of the ACM\u00a051, 74\u2013113 (2004)","journal-title":"Journal of the ACM"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/505241.505245","volume":"49","author":"F. Neven","year":"2002","unstructured":"Neven, F., Bussche, J.V.D.: Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM\u00a049, 56\u2013100 (2002)","journal-title":"Journal of the ACM"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-44503-X_22","volume-title":"Database Theory - ICDT 2001","author":"H. Meuss","year":"2000","unstructured":"Meuss, H., Schulz, K.U., Bry, F.: Towards aggregated answers for semistructured data. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 346\u2013360. Springer, Heidelberg (2000)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Filiot, E., Tison, S.: Regular n-ary queries in trees and variable independence. In: International Conference on Theoretical Computer Science (TCS), pp. 429\u2013443 (2008)","DOI":"10.1007\/978-0-387-09680-3_29"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J. Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. Journal of the ACM\u00a049, 716\u2013752 (2002)","journal-title":"Journal of the ACM"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: STOC, pp. 122\u2013127 (1982)","DOI":"10.1145\/800070.802184"},{"key":"13_CR11","unstructured":"Inaba, K., Hosoya, H.: XML transformation language based on monadic second order logic. In: Programming Language Technologies for XML (PLAN-X), pp. 49\u201360 (2007)"},{"key":"13_CR12","first-page":"41","volume":"11","author":"A. Berlea","year":"2004","unstructured":"Berlea, A., Seidl, H.: Binary queries for document trees. Nordic Journal of Computing\u00a011, 41\u201371 (2004)","journal-title":"Nordic Journal of Computing"}],"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-02979-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T21:24:39Z","timestamp":1552080279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02979-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029783","9783642029790"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02979-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}