{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:14Z","timestamp":1759637534478,"version":"3.37.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_17","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"214-225","source":"Crossref","is-referenced-by-count":1,"title":["Square on Deterministic, Alternating, and Boolean Finite Automata"],"prefix":"10.1007","author":[{"given":"Ivana","family":"Kraj\u0148\u00e1kov\u00e1","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"JA Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci. 10, 19\u201335 (1980). \nhttp:\/\/dx.doi.org\/10.1016\/0304-3975(80)90069-9","journal-title":"Theor. Comput. Sci."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-319-08846-4_10","volume-title":"Implementation and Application of Automata","author":"K \u010cevorov\u00e1","year":"2014","unstructured":"\u010cevorov\u00e1, K., Jir\u00e1skov\u00e1, G., Kraj\u0148\u00e1kov\u00e1, I.: On the square of regular languages. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 136\u2013147. Springer, Cham (2014). \nhttp:\/\/dx.doi.org\/10.1007\/978-3-319-08846-4_10"},{"issue":"1\u20134","key":"17_CR3","doi-asserted-by":"crossref","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. 35(1\u20134), 117\u2013132 (1990). \nhttp:\/\/dx.doi.org\/10.1080\/00207169008803893","journal-title":"Int. J. Comput. Math."},{"key":"17_CR4","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G.: Concatenation on deterministic and alternating automata. In: Bordihn, H., Freund, R., Nagy, B., Vaszil, G. (eds.) NCMA 2016, vol. 321, pp. 179\u2013194. \u00d6sterreichische Computer Gesellschaft, books@ocg.at (2016)"},{"key":"17_CR5","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. 7353, pp. 196\u2013204. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30642-6_19"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: Succint representation of regular languages by boolean automata. Theor. Comput. Sci. 13, 323\u2013330 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR7","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady 11, 1373\u20131375 (1970)","journal-title":"Soviet Math. Doklady"},{"issue":"6","key":"17_CR8","doi-asserted-by":"crossref","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 \n            $${L}^2$$\n           and \n            $${L}^k$$\n          . Inf. Process. Lett. 98(6), 231\u2013234 (2006). \nhttp:\/\/dx.doi.org\/10.1016\/j.ipl.2005.06.011","journal-title":"Inf. Process. Lett."},{"key":"17_CR9","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2012","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)"},{"issue":"2","key":"17_CR10","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). \nhttp:\/\/dx.doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:03:07Z","timestamp":1496401387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}