{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:30Z","timestamp":1742913690326,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_24","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"300-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Boundary of Prefix-Free Languages"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1142\/S0129054111008052","volume":"22","author":"JA Brzozowski","year":"2011","unstructured":"Brzozowski, J.A., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem. Internat. J. Found. Comput. Sci. 22(2), 301\u2013321 (2011)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-39310-5_9","volume-title":"Descriptional Complexity of Formal Systems","author":"H-S Eom","year":"2013","unstructured":"Eom, H.-S., Han, Y.-S., Salomaa, K.: State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 78\u201389. Springer, Heidelberg (2013)"},{"key":"24_CR3","unstructured":"Eom, H., Han, Y., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Discrete Mathematics and Computer Science, pp. 137\u2013151 (2014)"},{"issue":"1\u20132","key":"24_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y Han","year":"2009","unstructured":"Han, Y., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform. 90(1\u20132), 93\u2013106 (2009)","journal-title":"Fundam. Inform."},{"key":"24_CR5","unstructured":"Han, Y., 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, Hungary, Institute of Informatics (2009)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2015.01.022","volume":"578","author":"J Jir\u00e1sek","year":"2015","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G.: On the boundary of regular languages. Theoret. Comput. Sci. 578, 42\u201357 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR7","first-page":"1373","volume":"11","author":"A Maslov","year":"1970","unstructured":"Maslov, A.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady 11, 1373\u20131375 (1970)","journal-title":"Soviet Mathematics Doklady"},{"issue":"2\u20133","key":"24_CR8","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. 383(2\u20133), 140\u2013152 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR9","unstructured":"Shallit, J.: Open problems in automata theory and formal languages. https:\/\/cs.uwaterloo.ca\/shallit\/Talks\/open10r.pdf"},{"key":"24_CR10","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"issue":"2","key":"24_CR11","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. 125(2), 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:54:29Z","timestamp":1676584469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}