{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:33Z","timestamp":1725557913303},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131813"},{"type":"electronic","value":"9783642131820"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13182-0_8","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T14:55:17Z","timestamp":1276354517000},"page":"84-95","source":"Crossref","is-referenced-by-count":5,"title":["Quotient Complexity of Closed Languages"],"prefix":"10.1007","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","reference":[{"key":"8_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 Cybernet\u00a019, 445\u2013464 (2009)","journal-title":"Acta Cybernet"},{"key":"8_CR2","doi-asserted-by":"publisher","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. Internat. J. Algebra Comput.\u00a015, 149\u2013160 (2005)","journal-title":"Internat. J. Algebra Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-12200-2_21","volume-title":"LATIN 2010","author":"F. Bassino","year":"2010","unstructured":"Bassino, F., Giambruno, L., Nicaud, C.: Complexity of operations on cofinite languages. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 222\u2013233. Springer, Heidelberg (2010)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM\u00a011, 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"8_CR5","first-page":"25","volume-title":"11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009","author":"J. Brzozowski","year":"2009","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. In: Dassow, J., Pighizzini, G., Truthe, B. (eds.) 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009, pp. 25\u201342. Otto-von-Guericke-Universit\u00e4t, Magdeburg (2009), \n                  \n                    http:\/\/arxiv.org\/abs\/0907.4547"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-02737-6_10","volume-title":"DLT 2009","author":"J. Brzozowski","year":"2009","unstructured":"Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 125\u2013144. Springer, Heidelberg (2009)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-12200-2_20","volume-title":"LATIN 2010","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 208\u2013221. Springer, Heidelberg (2010) Full paper, \n                  \n                    http:\/\/arxiv.org\/abs\/0908.2083"},{"key":"8_CR8","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0410, 3236\u20133249 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-00982-2_21","volume-title":"LATA 2009","author":"J. Brzozowski","year":"2009","unstructured":"Brzozowski, J., Shallit, J., Xu, Z.: Decision procedures for convex languages. In: Dediu, A., Ionescu, A., Martin-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 247\u2013258. Springer, Heidelberg (2009)"},{"key":"8_CR10","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. System Sci.\u00a012, 350\u2013351 (1976)","journal-title":"J. Comput. System Sci."},{"key":"8_CR11","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. System Sci.\u00a09, 1\u201319 (1974)","journal-title":"J. Comput. System Sci."},{"key":"8_CR12","doi-asserted-by":"publisher","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. Combin. Theory\u00a06, 94\u201398 (1969)","journal-title":"J. Combin. Theory"},{"key":"8_CR13","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0410, 2537\u20132548 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR14","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: Automata, Formal Languages, and Related Topics, pp. 99\u2013115. University of Szeged, Hungary (2009)"},{"key":"8_CR15","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. Autom. Lang. Comb.\u00a06, 453\u2013466 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"8_CR16","doi-asserted-by":"publisher","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. Internat. J. Found. Comput. Sci.\u00a016, 511\u2013529 (2005)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0410, 5010\u20135021 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR18","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 \n                  \n                    \n                  \n                  $\\overline{A}$\n                 de l\u2019analysis situs. Fund. Math.\u00a03, 182\u2013199 (1922)","journal-title":"Fund. Math."},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-1-4612-3352-7_20","volume-title":"Sequences","author":"A. Luca de","year":"1990","unstructured":"de Luca, A., Varricchio, S.: Some combinatorial properties of factorial languages. In: Capocelli, R. (ed.) Sequences, pp. 258\u2013266. Springer, Heidelberg (1990)"},{"key":"8_CR20","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":"8_CR21","first-page":"7","volume":"2","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: On dual automata. Kibernetika (Kiev) 2, 7\u201310 (1966) (in Russian); English translation: Cybernetics 2, 6\u20139 (1966)","journal-title":"English translation: Cybernetics"},{"key":"8_CR22","unstructured":"Okhotin, A.: On the state complexity of scattered substrings and superstrings. Turku Centre for Computer Science Technical Report No.\u00a0849 (2007)"},{"key":"8_CR23","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. Internat. J. Found. Comput. Sci.\u00a013, 145\u2013159 (2002)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"A. Salomaa","year":"2004","unstructured":"Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoret. Comput. Sci.\u00a0320, 315\u2013329 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR25","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":"8_CR26","doi-asserted-by":"publisher","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. System Sci.\u00a018, 304\u2013306 (1979)","journal-title":"J. Comput. System Sci."},{"key":"8_CR27","first-page":"221","volume":"6","author":"S. Yu.","year":"2001","unstructured":"Yu., S.: State complexity of regular languages. J. Autom. Lang. Comb.\u00a06, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"8_CR28","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.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13182-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:55:46Z","timestamp":1558292146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13182-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131813","9783642131820"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13182-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}