{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:10:45Z","timestamp":1743138645990,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642225994"},{"type":"electronic","value":"9783642226007"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22600-7_4","type":"book-chapter","created":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T20:58:15Z","timestamp":1311109095000},"page":"43-54","source":"Crossref","is-referenced-by-count":1,"title":["The Power of Diversity"],"prefix":"10.1007","author":[{"given":"Denis","family":"Th\u00e9rien","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00208-006-0767-2","volume":"335","author":"K. Auinger","year":"2006","unstructured":"Auinger, K., Steinberg, B.: Varieties of finite supersolvable groups with the M. Hall property. Math. Ann.\u00a0335, 853\u2013877 (2006)","journal-title":"Math. Ann."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC\n                  1. Journal of Computer and System Sciences\u00a038(1), 150\u2013164 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jcss.1995.1029","volume":"50","author":"D.A.M. Barrington","year":"1995","unstructured":"Barrington, D.A.M., Straubing, H.: Superlinear lower bounds for bounded-width branching programs. Journal of Computer and System Sciences\u00a050(3), 374\u2013381 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D.A.M. Barrington","year":"1988","unstructured":"Barrington, D.A.M., Th\u00e9rien, D.: Finite monoids and the fine structure of NC\n                  1. Journal of the ACM\u00a035(4), 941\u2013952 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/0215040","volume":"15","author":"A. Borodin","year":"1986","unstructured":"Borodin, A., Dolev, D., Fich, F.E., Paul, W.: Bounds for width two branching programs. SIAM Journal on Computing\u00a015(2), 549\u2013560 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"J. Brzozowski","year":"1978","unstructured":"Brzozowski, J., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences\u00a016(1), 37\u201355 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR7","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0B. Academic Press, New York (1976)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory\u00a017(1), 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1090\/S0002-9947-1965-0188316-1","volume":"116","author":"K. Krohn","year":"1965","unstructured":"Krohn, K., Rhodes, J.: The algebraic theory of machines I. Trans. Amer. Math. Soc.\u00a0116, 450\u2013464 (1965)","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1090\/S0002-9939-1965-0175971-0","volume":"16","author":"W. Maurer","year":"1965","unstructured":"Maurer, W., Rhodes, J.: A property of finite simple non-Abelian groups. Proc. Amer. Math. Soc\u00a016, 552\u2013554 (1965)","journal-title":"Proc. Amer. Math. Soc"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF01212963","volume":"1","author":"P. McKenzie","year":"1991","unstructured":"McKenzie, P., P\u00e9ladeau, P., Th\u00e9rien, D.: NC1: The automata theoretic viewpoint. Computational Complexity\u00a01, 330\u2013359 (1991)","journal-title":"Computational Complexity"},{"issue":"2","key":"4_CR12","first-page":"190","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Computation\u00a08(2), 190\u2013194 (1965)","journal-title":"Information and Computation"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Borel sets and circuit complexity. In: Proceedings of the Fifteenth Annual ACM Symposium on the Theory of Computing, pp. 61\u201369 (1983)","DOI":"10.1145\/800061.808733"},{"key":"4_CR14","doi-asserted-by":"publisher","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. Birkhauser, Boston (1994)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D.: Classification of finite monoids: The language approach. In: Theoretical Computer Science, vol.\u00a014, pp. 195\u2013208 (1981)","DOI":"10.1016\/0304-3975(81)90057-8"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22600-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T08:19:46Z","timestamp":1553933986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22600-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642225994","9783642226007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22600-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}