{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:17Z","timestamp":1725888977281},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_7","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"89-101","source":"Crossref","is-referenced-by-count":2,"title":["Most Complex Non-returning Regular Languages"],"prefix":"10.1007","author":[{"given":"Janusz A.","family":"Brzozowski","sequence":"first","affiliation":[]},{"given":"Sylvie","family":"Davies","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"7_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. LNCS, vol. 8573, pp. 1\u201312. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-43951-7_1"},{"issue":"6","key":"7_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1142\/S0129054113400133","volume":"24","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A.: In search of the most complex regular languages. Int. J. Found. Comput. Sci. 24(6), 691\u2013708 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.: Unrestricted state complexity of binary operations on regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 60\u201372. Springer, Cham (2016). doi:\n10.1007\/978-3-319-41114-9_5\n\n. Revised version in \nhttp:\/\/arxiv.org\/abs\/1602.01387","DOI":"10.1007\/978-3-319-41114-9_5"},{"issue":"7","key":"7_CR4","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0129054113400285","volume":"24","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A., Tamm, H.: Complexity of atoms of regular languages. Int. J. Found. Comput. Sci. 24(7), 1009\u20131027 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Tamm, H.: Theory of \u00e1tomata. Theor. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","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. 6795, pp. 117\u2013128. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-22321-1_11"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.3233\/FI-2016-1326","volume":"144","author":"HS Eom","year":"2016","unstructured":"Eom, H.S., Han, Y.S., Jir\u00e1skov\u00e1, G.: State complexity of basic operations on non-returning regular languages. Fund. Inform. 144, 161\u2013182 (2016)","journal-title":"Fund. Inform."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.tcs.2004.04.010","volume":"327","author":"M Holzer","year":"2004","unstructured":"Holzer, M., K\u00f6nig, B.: On deterministic finite automata and syntactic monoid size. Theoret. Comput. Sci. 327, 319\u2013347 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"7_CR9","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ipl.2016.01.003","volume":"116","author":"S Iv\u00e1n","year":"2016","unstructured":"Iv\u00e1n, S.: Complexity of atoms, combinatorially. Inform. Process. Lett. 116(5), 356\u2013360 (2016)","journal-title":"Inform. Process. Lett."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-30500-2_20","volume-title":"Implementation and Application of Automata","author":"B Krawetz","year":"2005","unstructured":"Krawetz, B., Lawrence, J., Shallit, J.: State complexity and the monoid of transformations of a finite set. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 213\u2013224. Springer, Heidelberg (2005). doi:\n10.1007\/978-3-540-30500-2_20"},{"key":"7_CR11","first-page":"1","volume-title":"Handbook of Theoretical Computer Science","author":"D Perrin","year":"1990","unstructured":"Perrin, D.: Finite automata. In: van Leewen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 1\u201357. Elsevier, Amsterdam (1990)"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages: Volume 1 Word, Language, Grammar","author":"JE Pin","year":"1997","unstructured":"Pin, J.E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages: Volume 1 Word, Language, Grammar, pp. 679\u2013746. Springer, New York (1997)"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41\u2013110. Springer, Heidelberg (1997)"}],"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-60252-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:00:55Z","timestamp":1496401255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}