{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:05:59Z","timestamp":1767236759545,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_5","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"51-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Commutative Regular Languages with\u00a0Product-Form Minimal Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7866-075X","authenticated-orcid":false,"given":"Stefan","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-41114-9_6","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szyku\u0142a, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73\u201386. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_6"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0012-365X(73)80005-6","volume":"4","author":"JA Brzozowski","year":"1973","unstructured":"Brzozowski, J.A., Simon, I.: Characterizations of locally testable events. Discret. Math. 4(3), 243\u2013271 (1973)","journal-title":"Discret. Math."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0029355","volume-title":"Operating Systems","author":"RH Campbell","year":"1974","unstructured":"Campbell, R.H., Habermann, A.N.: The specification of process synchronization by path expressions. In: Gelenbe, E., Kaiser, C. (eds.) OS 1974. LNCS, vol. 16, pp. 89\u2013102. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0029355"},{"issue":"3","key":"5_CR4","first-page":"303","volume":"7","author":"C C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), 303\u2013310 (2002)","journal-title":"J. Autom. Lang. Comb."},{"volume-title":"The Book of Traces","year":"1995","key":"5_CR5","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, River Edge (1995)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theor. Comput. Sci. 27, 311\u2013332 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"5_CR7","first-page":"251","volume":"21","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21(4), 251\u2013310 (2017)","journal-title":"J. Autom. Lang. Comb."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-88009-7_6","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A Cano G\u00f3mez","year":"2008","unstructured":"Cano G\u00f3mez, A., \u00c1lvarez, G.I.: Learning commutative regular languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 71\u201383. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88009-7_6"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-15488-1_3","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"A Cano G\u00f3mez","year":"2010","unstructured":"Cano G\u00f3mez, A.: Inferring regular trace languages from positive and negative samples. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 11\u201323. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_3"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ic.2013.07.003","volume":"230","author":"AC G\u00f3mez","year":"2013","unstructured":"G\u00f3mez, A.C., Guaiana, G., Pin, J.: Regular languages and partial commutations. Inf. Comput. 230, 76\u201396 (2013)","journal-title":"Inf. Comput."},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2007.07.036","volume":"387","author":"H Gruber","year":"2007","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: The size of Higman-Haines sets. Theor. Comput. Sci. 387(2), 167\u2013176 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3233\/FI-2009-0035","volume":"91","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: More on the size of Higman-Haines sets: effective constructions. Fundam. Informaticae 91(1), 105\u2013121 (2009)","journal-title":"Fundam. Informaticae"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1051\/ita:2003002","volume":"36","author":"P H\u00e9am","year":"2002","unstructured":"H\u00e9am, P.: On shuffle ideals. RAIRO Theor. Inform. Appl. 36(4), 359\u2013384 (2002)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"5_CR14","unstructured":"Hoffmann, S.: Commutative regular languages - properties and state complexity. Inf. Comput. (submitted)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-21363-3_13","volume-title":"Algebraic Informatics","author":"S Hoffmann","year":"2019","unstructured":"Hoffmann, S.: Commutative regular languages \u2013 properties and state complexity. In: \u0106iri\u0107, M., Droste, M., Pin, J.\u00c9. (eds.) CAI 2019. LNCS, vol. 11545, pp. 151\u2013163. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21363-3_13"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Hoffmann, S.: State complexity investigations on commutative languages - the upward and downward closure, commutative aperiodic and commutative group languages. In: Han, Y.-S., Ko, S.-K. (eds.) DCFS 2021, LNCS 13037, pp. 64\u201375. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_6","DOI":"10.1007\/978-3-030-93489-7_6"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-81508-0_16","volume-title":"Developments in Language Theory","author":"S Hoffmann","year":"2021","unstructured":"Hoffmann, S.: State complexity of projection on\u00a0languages recognized by permutation automata and commuting letters. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 192\u2013203. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_16"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2012.04.009","volume":"449","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449, 93\u2013105 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2015.09.028","volume":"610","author":"P Karandikar","year":"2016","unstructured":"Karandikar, P., Niewerth, M., Schnoebelen, P.: On the state complexity of closures and interiors of regular languages with subwords and superwords. Theor. Comput. Sci. 610, 91\u2013107 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"5_CR20","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(6), 1266\u20131268 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical report, DAIMI Report Series 6(78) (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-07389-2_183","volume-title":"Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975","author":"A Mazurkiewicz","year":"1975","unstructured":"Mazurkiewicz, A.: Parallel recursive program schemes. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1975. LNCS, vol. 32, pp. 75\u201387. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07389-2_183"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.3233\/FI-2010-252","volume":"99","author":"A Okhotin","year":"2010","unstructured":"Okhotin, A.: On the state complexity of scattered substrings and superstrings. Fundam. Informaticae 99(3), 325\u2013338 (2010)","journal-title":"Fundam. Informaticae"},{"issue":"1","key":"5_CR24","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(1), 145\u2013159 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TSE.1978.231501","volume":"4","author":"AC Shaw","year":"1978","unstructured":"Shaw, A.C.: Software descriptions with flow expressions. IEEE Trans. Softw. Eng. 4, 242\u2013254 (1978)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"5_CR26","unstructured":"Wong, K.: On the complexity of projections of discrete-event systems. In: Proceedings of WODES 1998, Cagliari, Italy, pp. 201\u2013206 (1998)"},{"issue":"2","key":"5_CR27","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. Theor. Comput. Sci. 125(2), 315\u2013328 (1994)","journal-title":"Theor. 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-030-93489-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:04:10Z","timestamp":1767229450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}