{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:32:05Z","timestamp":1742985125658,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94631-3_7","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"75-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Technique for Reachability of States in Concatenation Automata"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Davies","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"7_CR1","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 #15","DOI":"10.46298\/dmtcs.1343"},{"key":"7_CR2","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."},{"issue":"06","key":"7_CR3","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 most complex regular languages. Int. J. Found. Comput. Sci. 24(06), 691\u2013708 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR4","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, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_5"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-60252-3_7","volume-title":"Descriptional Complexity of Formal Systems","author":"JA Brzozowski","year":"2017","unstructured":"Brzozowski, J.A., Davies, S.: Most complex non-returning regular languages. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 89\u2013101. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_7"},{"key":"7_CR6","doi-asserted-by":"publisher","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."},{"issue":"06","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1142\/S0129054112400515","volume":"23","author":"JA Brzozowski","year":"2012","unstructured":"Brzozowski, J.A., Liu, B.: Quotient complexity of star-free languages. Int. J. Found. Comput. Sci. 23(06), 1261\u20131276 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-53733-7_12","volume-title":"Language and Automata Theory and Applications","author":"JA Brzozowski","year":"2017","unstructured":"Brzozowski, J.A., Sinnamon, C.: Complexity of left-ideal, suffix-closed and suffix-free regular languages. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 171\u2013182. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_12"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.14232\/actacyb.23.1.2017.3","volume":"23","author":"JA Brzozowski","year":"2017","unstructured":"Brzozowski, J.A., Sinnamon, C.: Complexity of right-ideal, prefix-closed, and prefix-free regular languages. Acta Cybernetica 23(1), 9\u201341 (2017)","journal-title":"Acta Cybernetica"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 60\u201370. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45526-4_6"},{"key":"7_CR11","unstructured":"Davies, S.: A new technique for reachability of states in concatenation automata (2017). https:\/\/arxiv.org\/abs\/1710.05061"},{"key":"7_CR12","doi-asserted-by":"publisher","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. Fundam. Inform. 144, 161\u2013182 (2016)","journal-title":"Fundam. Inform."},{"key":"7_CR13","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) AFL 2009, pp. 99\u2013115. University of Szeged, Hungary, Institute of Informatics (2009)"},{"issue":"27\u201329","key":"7_CR14","doi-asserted-by":"publisher","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."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4204\/EPTCS.31.22","volume":"31","author":"Galina Jir\u00e1skov\u00e1","year":"2010","unstructured":"Jir\u00e1skov\u00e1, G., Krausov\u00e1, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) DCFS 2010, pp. 236\u2013244. University of Saskatchewan (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"7_CR16","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266\u20131268 (Russian). English translation: Soviet Math. Dokl. 11(1970), 1373\u20131375 (1970)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C Nicaud","year":"1999","unstructured":"Nicaud, C.: Average state complexity of operations on unary automata. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 231\u2013240. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48340-3_21"},{"issue":"01","key":"7_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. Int. J. Found. Comput. Sci. 13(01), 145\u2013159 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR19","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":"7_CR20","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","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:16:20Z","timestamp":1710324980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}