{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:44Z","timestamp":1759637804672,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192246"},{"type":"electronic","value":"9783319192253"}],"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-19225-3_6","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T15:51:06Z","timestamp":1434383466000},"page":"70-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Square on Ideal, Closed and Free Languages"],"prefix":"10.1007","author":[{"given":"Krist\u00edna","family":"\u010cevorov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theor. Comput. Sci. 470, 36\u201352 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR2","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. In: D\u00f6m\u00f6si, P., Iv\u00e1n, S. (eds.) AFL, pp. 123\u2013137 (2011)"},{"issue":"2","key":"6_CR3","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. Theor. Comp. Sys. 54(2), 277\u2013292 (2014)","journal-title":"Theor. Comp. Sys."},{"issue":"6","key":"6_CR4","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^2$$ and $$L^k$$. Inf. Process. Lett. 98(6), 231\u2013234 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"35","key":"6_CR5","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","volume":"410","author":"H Bordihn","year":"2009","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35), 3209\u20133222 (2009). DCFS proceedings","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-22321-1_11","volume-title":"Developments in Language Theory","author":"J Brzozowski","year":"2011","unstructured":"Brzozowski, J., Ye, Y.: Syntactic complexity of ideal and closed languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 117\u2013128. Springer, Heidelberg (2011)"},{"key":"6_CR7","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)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Jir\u00e1skov\u00e1, G., Krausov\u00e1, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) DCFS. EPTCS, vol. 31, pp. 197\u2013204 (2010)","DOI":"10.4204\/EPTCS.31.22"},{"issue":"4749","key":"6_CR9","doi-asserted-by":"publisher","first-page":"5010","DOI":"10.1016\/j.tcs.2009.07.049","volume":"410","author":"JY Kao","year":"2009","unstructured":"Kao, J.Y., Rampersad, N., Shallit, J.: On NFAs where all states are final, initial, or both. Theor. Comput. Sci. 410(4749), 5010\u20135021 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"\u010cevorov\u00e1, K., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P., Palmovsk\u00fd, M., \u0160ebej, J.: Operations on automata with all states final. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27\u201329, 2014. EPTCS, vol. 151, pp. 201\u2013215 (2014)","DOI":"10.4204\/EPTCS.151.14"},{"key":"6_CR11","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":"6_CR12","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Descriptional Complexity of Formal Systems, pp. 165\u2013176 (2006)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-74456-6_45","volume-title":"Mathematical Foundations of Computer Science 2007","author":"Y-S Han","year":"2007","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 501\u2013512. Springer, Heidelberg (2007)"},{"issue":"2","key":"6_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 complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315\u2013328 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19225-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:23:49Z","timestamp":1676942629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19225-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192246","9783319192253"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19225-3_6","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":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}