{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T07:09:57Z","timestamp":1791097797211,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679011","type":"print"},{"value":"9783540446125","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_61","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"660-669","source":"Crossref","is-referenced-by-count":12,"title":["On Diving in Trees Thomas Schwentick"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Schwentick","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"61_CR1","unstructured":"Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999."},{"key":"61_CR2","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406\u2013451, 1970.","journal-title":"Journal of Computer and System Sciences"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.","DOI":"10.1007\/3-540-28788-4"},{"key":"61_CR4","unstructured":"M. Fernandez, J. Sim\u00e9on, and P. Wadler. XML query languages: Experiences and exemplars. http:\/\/www-db.research.bell-labs.com\/user\/simeon\/xquery.html , 1999."},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"T. Hafer and W. Thomas. Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree. In ICALP, pages 269\u2013279, 1987.","DOI":"10.1007\/3-540-18088-5_22"},{"key":"61_CR6","unstructured":"R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971."},{"key":"61_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"FST & TCS","author":"A. Neumann","year":"1998","unstructured":"A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Arvind and R. Ramanujam, editors, FST & TCS, LNCS, pages 134\u2013145. Springer, 1998."},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"F. Neven and T. Schwentick. Query automata. In PODS, pages 205\u2013214. ACM Press, 1999.","DOI":"10.1145\/303976.303997"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. PODS 2000, 2000.","DOI":"10.1145\/335168.335217"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. In PODS, pages 11\u201317. ACM Press, 1998.","DOI":"10.1145\/275487.275489"},{"key":"61_CR11","unstructured":"L. Stockmeyer. The complexity of decision problems in automata and logic, 1974. Ph.D. Thesis, MIT, 1974."},{"issue":"1","key":"61_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57\u201381, 1968.","journal-title":"Mathematical Systems Theory"},{"key":"61_CR13","unstructured":"W. Thomas. Logical aspects in the study of tree languages. In B. Courcelle, editor, Proceedings of the 9th International Colloquium Trees in Algebra and Programming, pages 31\u201350. Cambridge University Press, 1984."},{"key":"61_CR14","unstructured":"W. Thomas. On chain logic, path logic, and first-order logic over infinite trees. In LICS, pages 245\u2013256, 1987."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:25Z","timestamp":1556376085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_61","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}