{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:22Z","timestamp":1759638202223},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_11","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"125-137","source":"Crossref","is-referenced-by-count":3,"title":["Nondeterministic Complexity of Operations on Closed and Ideal Languages"],"prefix":"10.1007","author":[{"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"JC Birget","year":"1993","unstructured":"Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267\u2013291 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"J Brzozowski","year":"2013","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theoret. Comput. Sci. 470, 36\u201352 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theor. Comput. Syst. 54, 277\u2013292 (2014)","journal-title":"Theor. Comput. Syst."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-319-19225-3_6","volume-title":"Descriptional Complexity of Formal Systems","author":"K \u010cevorov\u00e1","year":"2015","unstructured":"\u010cevorov\u00e1, K.: Square on ideal, closed and free languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 70\u201380. Springer, Heidelberg (2015)"},{"key":"11_CR5","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.) Automata and Formal Languages 2014 (AFL 2014). EPTCS, vol. 151, pp. 201\u2013215 (2014)","DOI":"10.4204\/EPTCS.151.14"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Han, Y.-S., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: DCFS 2010, pp. 189\u2013196 (2010)","DOI":"10.4204\/EPTCS.31.21"},{"issue":"1\u20132","key":"11_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y-S Han","year":"2009","unstructured":"Han, Y.-S., 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":"11_CR8","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087\u20131102 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jir\u00e1skov\u00e1, G.: Note on minimal automata and uniform communication protocols. In: Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back, pp. 163\u2013170. Taylor and Francis (2003)","DOI":"10.1201\/9780203009642.ch16"},{"issue":"7","key":"11_CR11","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22(7), 1639\u20131653 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-319-09704-6_20","volume-title":"Descriptional Complexity of Formal Systems","author":"G Jir\u00e1skov\u00e1","year":"2014","unstructured":"Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Complement on prefix-free, suffix-free, and non-returning NFA languages. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 222\u2013233. Springer, Heidelberg (2014)"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-3-319-19225-3_16","volume-title":"Descriptional Complexity of Formal Systems","author":"P Mlyn\u00e1r\u010dik","year":"2015","unstructured":"Mlyn\u00e1r\u010dik, P.: Complement on free and ideal languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 185\u2013196. Springer, Heidelberg (2015)"},{"key":"11_CR15","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)"}],"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-319-40946-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T08:21:28Z","timestamp":1600849288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}