{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:28:37Z","timestamp":1742959717353,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_6","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"64-76","source":"Crossref","is-referenced-by-count":0,"title":["A Language-Theoretical Approach to Descriptive Complexity"],"prefix":"10.1007","author":[{"given":"Micha\u00ebl","family":"Cadilhac","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Krebs","sequence":"additional","affiliation":[]},{"given":"Klaus-J\u00f6rn","family":"Lange","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DAM Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC $$^{1}$$ . J. Comput. Syst. Sci 41(3), 274\u2013306 (1990)","journal-title":"J. Comput. Syst. Sci"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Behle, C., Lange, K.J.: FO[ $$<$$ ]-uniformity. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), pp. 183\u2013189 (2006)","DOI":"10.1109\/CCC.2006.20"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-74456-6_15","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C Behle","year":"2007","unstructured":"Behle, C., Krebs, A., Mercer, M.: Linear circuits, two-variable logic and weakly blocked monoids. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 147\u2013158. Springer, Heidelberg (2007)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-02737-6_7","volume-title":"Developments in Language Theory","author":"C Behle","year":"2009","unstructured":"Behle, C., Krebs, A., Reifferscheid, S.: Regular languages definable by majority quantifiers with two variables. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 91\u2013102. Springer, Heidelberg (2009)"},{"issue":"3","key":"6_CR5","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N Immerman","year":"1989","unstructured":"Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18(3), 625\u2013638 (1989)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00224-006-1310-2","volume":"40","author":"A Krebs","year":"2007","unstructured":"Krebs, A., Lange, K.J., Reifferscheid, S.: Characterizing TC $$^{0}$$ in terms of infinite groups. Theor. Comput. Syst. 40(4), 303\u2013325 (2007)","journal-title":"Theor. Comput. Syst."},{"key":"6_CR7","unstructured":"Krebs, A.: Typed semigroups, majority logic, and threshold circuits. Ph.D. thesis, Eberhard Karls University of T\u00fcbingen (2008)"},{"issue":"4","key":"6_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1006\/jcss.2000.1742","volume":"62","author":"C Lautemann","year":"2001","unstructured":"Lautemann, C., McKenzie, P., Schwentick, T., Vollmer, H.: The descriptive complexity approach to LOGCFL. J. Comput. Syst. Sci. 62(4), 629\u2013652 (2001)","journal-title":"J. Comput. Syst. Sci."},{"volume-title":"Handbook of Formal Languages: Volume 3 Beyond Words","year":"1997","key":"6_CR9","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages: Volume 3 Beyond Words. Springer, Heidelberg (1997)"},{"key":"6_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Boston (1994)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-45995-2_13","volume-title":"LATIN 2002: Theoretical Informatics","author":"H Straubing","year":"2002","unstructured":"Straubing, H., Th\u00e9rien, D.: Weakly iterated block products of finite monoids. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 91\u2013104. Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00224-003-1109-3","volume":"37","author":"D Th\u00e9rien","year":"2004","unstructured":"Th\u00e9rien, D., Wilke, T.: Nesting until and since in linear temporal logic. Theor. Comput. Syst. 37(1), 111\u2013131 (2004)","journal-title":"Theor. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:56Z","timestamp":1498315556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}