{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T14:28:02Z","timestamp":1773498482143,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T00:00:00Z","timestamp":1384819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00224-013-9515-7","type":"journal-article","created":{"date-parts":[[2013,11,18]],"date-time":"2013-11-18T07:04:32Z","timestamp":1384758272000},"page":"277-292","source":"Crossref","is-referenced-by-count":35,"title":["Quotient Complexity of Closed Languages"],"prefix":"10.1007","volume":"54","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenglong","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,19]]},"reference":[{"issue":"2","key":"9515_CR1","first-page":"445","volume":"19","author":"T. Ang","year":"2009","unstructured":"Ang, T., Brzozowski, J.: Languages convex with respect to binary relations, and their closure properties. Acta Cybern. 19(2), 445\u2013464 (2009)","journal-title":"Acta Cybern."},{"key":"9515_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1142\/S0218196705002116","volume":"15","author":"S.V. Avgustinovich","year":"2005","unstructured":"Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Int. J. Algebra Comput. 15, 149\u2013160 (2005)","journal-title":"Int. J. Algebra Comput."},{"key":"9515_CR3","series-title":"LNCS","first-page":"222","volume-title":"Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN)","author":"F. Bassino","year":"2010","unstructured":"Bassino, F., Giambruno, L., Nicaud, C.: Complexity of operations on cofinite languages. In: L\u00f3pez-Ortiz, A. (ed.) Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN). LNCS, vol. 6034, pp. 222\u2013233. Springer, Berlin (2010)"},{"issue":"4","key":"9515_CR4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"9515_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-13089-2_1","volume-title":"Proceedings of the 4th International Conference on Language and Automata Theory (LATA)","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Complexity in convex languages. In: Dediu, A.H., Fernau, H., Martin-Vide, C. (eds.) Proceedings of the 4th International Conference on Language and Automata Theory (LATA). LNCS, vol. 6031, pp. 1\u201315. Springer, Berlin (2010)"},{"issue":"1\/2","key":"9515_CR6","first-page":"71","volume":"15","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"key":"9515_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1142\/S0129054111008052","volume":"22","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem. Int. J. Found. Comput. Sci. 22, 301\u2013321 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9515_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"J. Brzozowski","year":"2013","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theor. Comput. Sci. 470, 36\u201352 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"9515_CR9","first-page":"123","volume-title":"Proceedings of the 13th Int. Conference on Automata and Formal Languages (AFL)","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free languages. In: D\u00f6m\u00f6si, P., Szabolcs, I. (eds.) Proceedings of the 13th Int. Conference on Automata and Formal Languages (AFL), pp. 123\u2013137. Institute of Mathematics and Informatics, College of Ny\u00edregyh\u00e1za, Ny\u00edregyh\u00e1za (2011)"},{"key":"9515_CR10","doi-asserted-by":"crossref","first-page":"3236","DOI":"10.1016\/j.tcs.2009.05.010","volume":"410","author":"J. Brzozowski","year":"2009","unstructured":"Brzozowski, J., Santean, N.: Predictable semiautomata. Theor. Comput. Sci. 410, 3236\u20133249 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9515_CR11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.ic.2010.11.009","volume":"209","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Shallit, J., Xu, Z.: Decision problems for convex languages. Inf. Comput. 209, 353\u2013367 (2011)","journal-title":"Inf. Comput."},{"key":"9515_CR12","series-title":"LNCS","first-page":"60","volume-title":"Revised papers from the 4th International Workshop on Automata Implementation, (WIA)","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K. II, Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) Revised papers from the 4th International Workshop on Automata Implementation, (WIA). LNCS, vol. 2214, pp. 60\u201370. Springer, Berlin (2001)"},{"key":"9515_CR13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-1-4612-3352-7_20","volume-title":"Sequences: Combinatorics, Compression, Security, and Transmission","author":"A. Luca de","year":"1990","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of factorial languages. In: Capocelli, R. (ed.) Sequences: Combinatorics, Compression, Security, and Transmission, pp. 258\u2013266. Springer, Berlin (1990)"},{"key":"9515_CR14","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/S0022-0000(76)80006-2","volume":"12","author":"Z. Galil","year":"1976","unstructured":"Galil, Z., Simon, J.: A note on multiple-entry finite automata. J. Comput. Syst. Sci. 12, 350\u2013351 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9515_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","volume":"9","author":"A. Gill","year":"1974","unstructured":"Gill, A., Kou, L.T.: Multiple-entry finite automata. J. Comput. Syst. Sci. 9(1), 1\u201319 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9515_CR16","doi-asserted-by":"crossref","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, 167\u2013176 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9515_CR17","doi-asserted-by":"crossref","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. Inform. 91(1), 105\u2013121 (2009)","journal-title":"Fundam. Inform."},{"issue":"1","key":"9515_CR18","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"L.H. Haines","year":"1969","unstructured":"Haines, L.H.: On free monoids partially ordered by embedding. J. Comb. Theory 6(1), 94\u201398 (1969)","journal-title":"J. Comb. Theory"},{"issue":"27\u201329","key":"9515_CR19","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y.S. Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27\u201329), 2537\u20132548 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9515_CR20","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics","author":"Y.S. Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Automata, Formal Languages, and Related Topics, pp. 99\u2013115. University of Szeged, Szeged (2009)"},{"key":"9515_CR21","first-page":"453","volume":"6","author":"M. Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J.\u00a0Autom. Lang. Comb. 6, 453\u2013466 (2001)","journal-title":"J.\u00a0Autom. Lang. Comb."},{"key":"9515_CR22","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1142\/S0129054105003133","volume":"16","author":"J. Jir\u00e1sek","year":"2005","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G., Szabari, A.: State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16, 511\u2013529 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"47\u201349","key":"9515_CR23","doi-asserted-by":"crossref","first-page":"5010","DOI":"10.1016\/j.tcs.2009.07.049","volume":"410","author":"J.Y. Kao","year":"2009","unstructured":"Kao, J.Y., Rampersad, N., Shallit, J.: On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(47\u201349), 5010\u20135021 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9515_CR24","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4064\/fm-3-1-182-199","volume":"3","author":"C. Kuratowski","year":"1922","unstructured":"Kuratowski, C.: Sur l\u2019op\u00e9ration $\\overline{A}$ de l\u2019analysis situs. Fundam. Math. 3, 182\u2013199 (1922) (in French)","journal-title":"Fundam. Math."},{"key":"9515_CR25","first-page":"1266","volume":"194","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266\u20131268 (1970) (in Russian). English translation: Soviet Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9515_CR26","first-page":"7","volume":"2","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: On dual automata. Kibernetika 2, 7\u201310 (1966) (in Russian). English translation: Cybernetics 2, 6\u20139 (1970)","journal-title":"Kibernetika"},{"issue":"3","key":"9515_CR27","doi-asserted-by":"crossref","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. Inform. 99(3), 325\u2013338 (2010)","journal-title":"Fundam. Inform."},{"key":"9515_CR28","doi-asserted-by":"crossref","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, 145\u2013159 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9515_CR29","first-page":"481","volume-title":"Automata, Languages and Programming","author":"G. Thierrin","year":"1973","unstructured":"Thierrin, G.: Convex languages. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 481\u2013492. North-Holland, Amsterdam (1973)"},{"key":"9515_CR30","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0022-0000(79)90038-2","volume":"18","author":"P.A.S. Veloso","year":"1979","unstructured":"Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. J. Comput. Syst. Sci. 18, 304\u2013306 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9515_CR31","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":"9515_CR32","doi-asserted-by":"crossref","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":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9515-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9515-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9515-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T06:38:21Z","timestamp":1596868701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9515-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,19]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9515"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9515-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,19]]}}}