{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:02:26Z","timestamp":1754193746480},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_1","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["Symmetric Groups and Quotient Complexity of Boolean Operations"],"prefix":"10.1007","author":[{"given":"Jason","family":"Bell","sequence":"first","affiliation":[]},{"given":"Janusz","family":"Brzozowski","sequence":"additional","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\/2","key":"1_CR1","first-page":"71","volume":"15","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb.\u00a015(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1142\/S0129054113400133","volume":"24","author":"J. Brzozowski","year":"2013","unstructured":"Brzozowski, J.: In search of the most complex regular languages. Int. J. Found. Comput. Sc.\u00a024(6), 691\u2013708 (2013)","journal-title":"Int. J. Found. Comput. Sc."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Davies, G.: Maximally atomic languages. In: \u00c9sik, Z., F\u00fclop, Z. (eds.) 14th International Conference Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29. EPTCS, vol.\u00a0151, pp. 151\u2013161 (2014)","DOI":"10.4204\/EPTCS.151.10"},{"key":"1_CR4","unstructured":"Brzozowski, J., Davies, G.: Most complex regular right-ideal languages. In: 16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014, Turku, Finland, August 5-8. LNCS (to appear, 2014)"},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0129054113400285","volume":"24","author":"J. Brzozowski","year":"2013","unstructured":"Brzozowski, J., Tamm, H.: Complexity of atoms of regular languages. Int. J. Found. Comput. Sc.\u00a024(7), 1009\u20131027 (2013)","journal-title":"Int. J. Found. Comput. Sc."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00e1tomata. Theoret. Comput. Sci. (article in press, 2014)","DOI":"10.1016\/j.tcs.2014.04.016"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ic.2008.03.018","volume":"206","author":"G. Liu","year":"2008","unstructured":"Liu, G., Martin-Vide, C., Salomaa, A., Yu, S.: State complexity of basic language operations combined with reversal. Inform. and Comput.\u00a0206, 1178\u20131186 (2008)","journal-title":"Inform. and Comput."},{"key":"#cr-split#-1_CR8.1","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR\u00a0194, 1266-1268 (1970) (Russian)"},{"key":"#cr-split#-1_CR8.2","unstructured":"English Translation: Soviet Math. Dokl. 11, 1373-1375 (1970)"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.21136\/CPMF.1939.121729","volume":"68","author":"S. Piccard","year":"1939","unstructured":"Piccard, S.: Sur les bases du groupe sym\u00e9trique. \u010casopis Pro P\u011bstov\u00e1n\u00ed Matematiky a Fysiky\u00a068(1), 15\u201330 (1939)","journal-title":"\u010casopis Pro P\u011bstov\u00e1n\u00ed Matematiky a Fysiky"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2011.12.049","volume":"429","author":"A. Restivo","year":"2012","unstructured":"Restivo, A., Vaglica, R.: A graph theoretic approach to automata minimality. Theoret. Comput. Sc.\u00a0429, 282\u2013291 (2012)","journal-title":"Theoret. Comput. Sc."},{"key":"1_CR11","volume-title":"The Theory of Groups: An Introduction","author":"J. Rotman","year":"1965","unstructured":"Rotman, J.: The Theory of Groups: An Introduction. Allyn and Bacon, Inc., Boston (1965)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"A. Salomaa","year":"2004","unstructured":"Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci.\u00a0320, 315\u2013329 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR13","volume-title":"Group Theory","author":"M. Suzuki","year":"1982","unstructured":"Suzuki, M.: Group Theory, vol.\u00a01. Springer, Berlin (1982)"},{"key":"1_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-988-2","volume-title":"The Finite Simple Groups","author":"R. Wilson","year":"2009","unstructured":"Wilson, R.: The Finite Simple Groups. Springer, Berlin (2009)"},{"key":"1_CR15","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb.\u00a06, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T21:48:19Z","timestamp":1597960099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}