{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:29Z","timestamp":1725796769524},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_9","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T05:43:21Z","timestamp":1405057401000},"page":"90-101","source":"Crossref","is-referenced-by-count":1,"title":["Most Complex Regular Right-Ideal Languages"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gareth","family":"Davies","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-43951-7_1","volume-title":"Automata, Languages, and Programming","author":"J. Bell","year":"2014","unstructured":"Bell, J., Brzozowski, J., Moreira, N., Reis, R.: Symmetric groups and quotient complexity of boolean operations. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol.\u00a08573, pp. 1\u201312. Springer, Heidelberg (2014)"},{"issue":"1\/2","key":"9_CR2","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":"9_CR3","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. Internat. J. Found. Comput. Sci.\u00a024(6), 691\u2013708 (2013)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"9_CR4","unstructured":"Brzozowski, J., Davies, G.: Most complex regular right-ideal languages (2013), http:\/\/arxiv.org\/abs\/1311.4448"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"J. Brzozowski","year":"2013","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci.\u00a0470, 36\u201352 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"9_CR6","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. Sci.\u00a024(7), 1009\u20131027 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"J. Brzozowski","year":"2014","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00e1tomata. Theoret. Comput. Sci.\u00a0539, 13\u201327 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22321-1_11","volume-title":"Developments in Language Theory","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Ye, Y.: Syntactic complexity of ideal and closed languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 117\u2013128. Springer, Heidelberg (2011)"},{"key":"#cr-split#-9_CR9.1","unstructured":"Mirkin, B.G.: On dual automata. Kibernetika (Kiev)\u00a02, 7-10 (1970) (Russian)"},{"key":"#cr-split#-9_CR9.2","unstructured":"English translation: Cybernetics 2, 6-9 (1966)"},{"issue":"1","key":"9_CR10","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":"9_CR11","series-title":"Word, Language, Grammar","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J.E. Pin","year":"1997","unstructured":"Pin, J.E.: Syntactic semigroups. In: Handbook of Formal Languages. Word, Language, Grammar, vol.\u00a01, pp. 679\u2013746. Springer, New York (1997)"},{"key":"9_CR12","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."}],"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-319-09704-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T02:00:07Z","timestamp":1598061607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}