{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:50:03Z","timestamp":1742939403067,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_15","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"189-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[]},{"given":"Mat\u00fa\u0161","family":"Palmovsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Juraj","family":"\u0160ebej","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"15_CR1","unstructured":"Brzozowski, J.A.: Kuratowski algebras generated from \n                      \n                        \n                      \n                      $$L$$\n                     by applying the operators of Kleene closure and complement. Personal communication (2016)"},{"issue":"2","key":"15_CR2","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":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-41114-9_6","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szyku\u0142a, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73\u201386. Springer, Cham (2016). doi:\n                      10.1007\/978-3-319-41114-9_6"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54(2), 277\u2013292 (2014)","journal-title":"Theory Comput. Syst."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-25929-6_9","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"R Cmorik","year":"2012","unstructured":"Cmorik, R., Jir\u00e1skov\u00e1, G.: Basic operations on binary suffix-free languages. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94\u2013102. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-25929-6_9"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.2307\/2691300","volume":"64","author":"JH Fife","year":"1991","unstructured":"Fife, J.H.: The Kuratowski closure-complement problem. Math. Mag. 64, 180\u2013182 (1991)","journal-title":"Math. Mag."},{"issue":"27\u201329","key":"15_CR7","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y Han","year":"2009","unstructured":"Han, Y., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27\u201329), 2537\u20132548 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR8","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics","author":"Y Han","year":"2009","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. Institute of Informatics, University of Szeged, Szeged (2009)"},{"key":"15_CR9","volume-title":"Introduction to Automata Theory Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-40946-7_13","volume-title":"Implementation and Application of Automata","author":"J Jir\u00e1sek","year":"2016","unstructured":"Jir\u00e1sek, J., \u0160ebej, J.: Kuratowski algebras generated by prefix-free languages. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 150\u2013162. Springer, Cham (2016). doi:\n                      10.1007\/978-3-319-40946-7_13"},{"key":"15_CR11","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. 7410, pp. 380\u2013391. Springer, Heidelberg (2012). doi:\n                      10.1007\/978-3-642-31653-1_34"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4064\/fm-3-1-182-199","volume":"3","author":"K Kuratowski","year":"1922","unstructured":"Kuratowski, K.: Sur l\u2019operation \n                      \n                        \n                      \n                      $$\\bar{\\rm A}$$\n                     de l\u2019analysis situs. Fundam. Math. 3, 182\u2013199 (1922)","journal-title":"Fundam. Math."},{"key":"15_CR13","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)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages, Volume 1 Word, Language, Grammar","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A., et al. (eds.) Handbook of Formal Languages, Volume 1 Word, Language, Grammar, pp. 41\u2013110. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T18:31:09Z","timestamp":1580322669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"3 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dcfs2017.di.unimi.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}