{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:25:47Z","timestamp":1743157547015,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"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-53733-7_12","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T10:39:21Z","timestamp":1487155161000},"page":"171-182","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Left-Ideal, Suffix-Closed and Suffix-Free 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,2,16]]},"reference":[{"issue":"2","key":"12_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 Cybern. 19(2), 445\u2013464 (2009)","journal-title":"Acta Cybern."},{"key":"12_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, Cambridge (2010)"},{"issue":"1\/2","key":"12_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":"12_CR4","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":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-41114-9_5","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","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, Heidelberg (2016). doi: 10.1007\/978-3-319-41114-9_5"},{"issue":"2","key":"12_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.14232\/actacyb.22.2.2015.4","volume":"22","author":"JA Brzozowski","year":"2015","unstructured":"Brzozowski, J.A., Davies, S.: Quotient complexities of atoms in regular ideal languages. Acta Cybern. 22(2), 293\u2013311 (2015)","journal-title":"Acta Cybern."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A., Davies, S., Liu, B.Y.V.: Most complex regular ideal languages. Discrete Math. Theoret. Comput. Sci. 18(3) (2016). Paper #5","DOI":"10.46298\/dmtcs.1343"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36\u201352 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","doi-asserted-by":"crossref","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":"12_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.tcs.2012.04.011","volume":"449","author":"JA Brzozowski","year":"2012","unstructured":"Brzozowski, J.A., Li, B., Ye, Y.: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theoret. Comput. Sci. 449, 37\u201353 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR11","unstructured":"Brzozowski, J.A., Sinnamon, C.: Complexity of left-ideal, suffix-closed, and suffix-free regular languages (2016). http:\/\/arxiv.org\/abs\/1610.00728"},{"key":"12_CR12","unstructured":"Brzozowski, J.A., Sinnamon, C.: Unrestricted state complexity of binary operations on regular and ideal languages (2016). http:\/\/arxiv.org\/abs\/1609.04439"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-09698-8_2","volume-title":"Developments in Language Theory","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Szyku\u0142a, M.: Upper bounds on syntactic complexity of left and two-sided ideals. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 13\u201324. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-09698-8_2"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Brzozowski, J., Szyku\u0142a, M.: Complexity of suffix-free regular languages. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 146\u2013159. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-22177-9_12 . Full paper at http:\/\/arxiv.org\/abs\/1504.05159","DOI":"10.1007\/978-3-319-22177-9_12"},{"key":"12_CR15","unstructured":"Brzozowski, J.A., Szyku\u0142a, M., Ye, Y.: Syntactic complexity of regular ideals, (September 2015). http:\/\/arxiv.org\/abs\/1509.06032"},{"issue":"7","key":"12_CR16","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0129054113400285","volume":"24","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A., Tamm, H.: Quotient complexities of atoms of regular languages. Int. J. Found. Comput. Sci. 24(7), 1009\u20131027 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR17","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. Theoret. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR18","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":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-25929-6_9","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"R Cmorik","year":"2012","unstructured":"Cmorik, R., Jir\u00e1skov\u00e1, G.: Basic operations on binary suffix-free languages. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94\u2013102. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-25929-6_9"},{"issue":"27\u201329","key":"12_CR20","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"YS Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoret. Comput. Sci. 410(27\u201329), 2537\u20132548 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"12_CR21","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(3), 319\u2013347 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"12_CR22","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":"12_CR23","unstructured":"Jir\u00e1skov\u00e1, G., Olej\u00e1r, P.: State complexity of union and intersection of binary suffix-free languages. In: Bordihn, H., et al. (eds.) NMCA, pp. 151\u2013166. Austrian Computer Society (2009)"},{"key":"12_CR24","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":"12_CR25","unstructured":"Myhill, J.: Finite automata and representation of events. Wright Air Development Center. Technical report, pp. 57\u2013624 (1957)"},{"key":"12_CR26","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages. vol. 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. vol. 1: Word, Language, Grammar, pp. 679\u2013746. Springer, New York (1997)"},{"key":"12_CR27","unstructured":"Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 481\u2013492. North-Holland (1973)"},{"key":"12_CR28","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."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T05:18:41Z","timestamp":1658639921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}