{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:14Z","timestamp":1725740354745},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_19","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"208-219","source":"Crossref","is-referenced-by-count":0,"title":["On the Boundary of Regular Languages"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1142\/S0129054111008052","volume":"22","author":"J.A. Brzozowski","year":"2011","unstructured":"Brzozowski, J.A., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem. Int. J. Found. Comput. Sci.\u00a022, 301\u2013321 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.2307\/2691300","volume":"64","author":"J.H. Fife","year":"1991","unstructured":"Fife, J.H.: The Kuratowski closure-complement problem. Math. Mag.\u00a064, 180\u2013182 (1991)","journal-title":"Math. Mag."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-31653-1_34","volume-title":"Developments in Language Theory","author":"G. Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Shallit, J.: The state complexity of star-complement-star. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 380\u2013391. Springer, Heidelberg (2012)"},{"key":"19_CR4","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":"19_CR5","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. Dokl.\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop.\u00a03, 114\u2013129 (1959)","journal-title":"IBM Res. Develop."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A. Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theoret. Comput. Sci.\u00a0383, 140\u2013152 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR8","unstructured":"Shallit, J.: Open problems in automata theory and formal languages, \n                    \n                      https:\/\/cs.uwaterloo.ca\/~shallit\/Talks\/open10r.pdf"},{"key":"19_CR9","unstructured":"Shallit, J.: The state complexity of \n                    \n                      \n                    \n                    $(\\overline{L^*})^*$\n                   and \n                    \n                      \n                    \n                    $L^*\\cap (\\overline{L})^*$\n                  . Personal Communication (2010)"},{"key":"19_CR10","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":"19_CR11","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, ch. 2, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"key":"19_CR12","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-642-39274-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:30:50Z","timestamp":1557945050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}