{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:38Z","timestamp":1759638578571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_5","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Proper Prefix-Convex Regular Languages"],"prefix":"10.1007","author":[{"given":"Janusz A.","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corwin","family":"Sinnamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"2","key":"5_CR1","first-page":"445","volume":"19","author":"T Ang","year":"2009","unstructured":"Ang, T., Brzozowski, J.A.: Languages convex with respect to binary relations, and their closure properties. Acta Cybernet. 19(2), 445\u2013464 (2009)","journal-title":"Acta Cybernet."},{"key":"5_CR2","volume-title":"Codes and Automata (Encyclopedia of Mathematics and its Applications)","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2010)"},{"issue":"1\/2","key":"5_CR3","first-page":"71","volume":"15","author":"JA Brzozowski","year":"2010","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","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"},{"issue":"3","key":"5_CR5","first-page":"1","volume":"18","author":"JA Brzozowski","year":"2016","unstructured":"Brzozowski, J.A., Davies, S., Liu, B.Y.V.: Most complex regular ideal languages. Discrete Math. Theoret. Comput. Sci. 18(3), 1\u201325 (2016). Paper #15","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54, 277\u2013292 (2014)","journal-title":"Theory Comput. Syst."},{"key":"5_CR7","unstructured":"Brzozowski, J.A., Sinnamon, C.: Complexity of prefix-convex regular languages (2016). http:\/\/arxiv.org\/abs\/1605.06697"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A., Sinnamon, C.: Complexity of right-ideal, prefix-closed, and prefix-free regular languages. Acta Cybernet. (2017, to appear)","DOI":"10.1007\/978-3-319-53733-7_12"},{"key":"5_CR9","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR10","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:10.1007\/978-3-642-22321-1_11"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-662-07675-0_9","volume-title":"Handbook of Formal Languages","author":"M Crochemore","year":"1997","unstructured":"Crochemore, M., Hancart, C.: Automata for pattern matching. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 399\u2013462. Springer, Heidelberg (1997)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","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(3), 319\u2013347 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","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":"5_CR14","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:10.1007\/978-3-540-30500-2_20"},{"key":"5_CR15","first-page":"1266","volume":"194","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266\u20131268 (1970). (Russian). English translation: Soviet Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"5_CR16","unstructured":"Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 481\u2013492. North-Holland (1973)"},{"key":"5_CR17","first-page":"221","volume":"6","author":"S Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb. 6, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"5_CR18","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. 125(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:31:02Z","timestamp":1710343862000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}