{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:14:19Z","timestamp":1767237259381},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088457"},{"type":"electronic","value":"9783319088464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08846-4_10","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T11:56:43Z","timestamp":1404475003000},"page":"136-147","source":"Crossref","is-referenced-by-count":7,"title":["On the Square of Regular Languages"],"prefix":"10.1007","author":[{"given":"Krist\u00edna","family":"\u010cevorov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Kraj\u0148\u00e1kov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J. Brzozowski","year":"1980","unstructured":"Brzozowski, J., Leiss, E.: On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci.\u00a010, 19\u201335 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-39310-5_26","volume-title":"Descriptional Complexity of Formal Systems","author":"K. \u010cevorov\u00e1","year":"2013","unstructured":"\u010cevorov\u00e1, K.: Kleene star on unary regular languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol.\u00a08031, pp. 277\u2013288. Springer, Heidelberg (2013)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/00207169008803893","volume":"35","author":"A. Fellah","year":"1990","unstructured":"Fellah, A., J\u00fcrgensen, H., Yu, S.: Constructions for alternating finite automata. Int. J. Comput. Math.\u00a035, 117\u2013132 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G. Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci.\u00a0330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-30642-6_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"G. Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G.: Descriptional complexity of operations on alternating and boolean automata. In: Hirsch, E.A., Karhum\u00e4ki, J., Lepist\u00f6, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol.\u00a07353, pp. 196\u2013204. Springer, Heidelberg (2012)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by boolean automata. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(81)90005-0","volume":"14","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: On generalized language equations. Theoret. Comput. Sci.\u00a014, 63\u201377 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR9","first-page":"1373","volume":"11","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"10_CR10","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., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.06.011","volume":"98","author":"N. Rampersad","year":"2006","unstructured":"Rampersad, N.: The state complexity of L\n                  2 and L\n                  \n                    k\n                  . Inform. Process. Lett.\u00a098, 231\u2013234 (2006)","journal-title":"Inform. Process. Lett."},{"key":"10_CR12","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"key":"10_CR14","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 complexity 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","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08846-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T20:59:42Z","timestamp":1547845182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08846-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088457","9783319088464"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08846-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}