{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:45:16Z","timestamp":1742993116882,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_30","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"416-430","source":"Crossref","is-referenced-by-count":12,"title":["The Nesting-Depth of Disjunctive \u03bc-Calculus for Tree Languages and the Limitedness Problem"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","first-page":"285","volume-title":"Proceedings of LICS 2006","author":"M. Bojanczyk","year":"2006","unstructured":"Bojanczyk, M., Colcombet, T.: Bounds in \u03c9-regularity. In: Proceedings of LICS 2006, pp. 285\u2013296. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-540-73420-8_77","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T.: A combinatorial theorem for trees. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 901\u2013912. Springer, Heidelberg (2007)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","volume-title":"Proceedings of ICALP 2008","author":"T. Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The non-deterministic Mostowski hierarchy and distance-parity automata. In: Proceedings of ICALP 2008. LNCS, vol.\u00a05126, pp. 398\u2013409. Springer, Heidelberg (2008)"},{"key":"30_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., L\u00f6ding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), \n                      http:\/\/tata.gforge.inria.fr"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","volume":"4","author":"J. Doner","year":"1970","unstructured":"Doner, J.: Tree acceptors and some of their applications. Journal of Computer and System Sciences\u00a04, 406\u2013451 (1970)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1307\/mmj\/1028998975","volume":"10","author":"L.C. Eggan","year":"1963","unstructured":"Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J.\u00a010(4), 385\u2013397 (1963)","journal-title":"Michigan Math. J."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0890-5401(88)90033-8","volume":"78","author":"K. Hashiguchi","year":"1988","unstructured":"Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput.\u00a078(2), 124\u2013169 (1988)","journal-title":"Inf. Comput."},{"issue":"39","key":"30_CR8","first-page":"455","volume":"3","author":"D. Kirsten","year":"2005","unstructured":"Kirsten, D.: Distance desert automata and the star height problem. RAIRO\u00a03(39), 455\u2013509 (2005)","journal-title":"RAIRO"},{"issue":"1","key":"30_CR9","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(1), 57\u201381 (1968)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:14:21Z","timestamp":1715058861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}