{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:42Z","timestamp":1725536802358},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"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-03816-7_39","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"451-463","source":"Crossref","is-referenced-by-count":2,"title":["FO Model Checking on Nested Pushdown Trees"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kartzow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11817963_31","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2006","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of nested trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"key":"39_CR2","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)"},{"issue":"1-3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tcs.2008.01.053","volume":"400","author":"A. Blumensath","year":"2008","unstructured":"Blumensath, A.: On the structure of graphs in the caucal hierarchy. Theor. Comput. Sci.\u00a0400(1-3), 19\u201345 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR4","first-page":"51","volume-title":"Proc. 15th IEEE Symp. on Logic in Computer Science","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: Proc. 15th IEEE Symp. on Logic in Computer Science, pp. 51\u201362. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-68804-8_3","volume-title":"Finite Model Theory and Its Applications","author":"E. Gr\u00e4del","year":"2007","unstructured":"Gr\u00e4del, E.: Finite model theory and descriptive complexity. In: Finite Model Theory and Its Applications, pp. 125\u2013230. Springer, Heidelberg (2007)"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Hague, M., Murawski, A.S., Ong, C.-H.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: LICS 2008: Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 452\u2013461 (2008)","DOI":"10.1109\/LICS.2008.34"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:52:34Z","timestamp":1552117954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}