{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:10Z","timestamp":1759637770459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"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-60134-2_12","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"138-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nondeterministic Complexity of Operations on Free and Convex 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":[[2017,5,28]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J Birget","year":"1992","unstructured":"Birget, J.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43(4), 185\u2013190 (1992). doi:10.1016\/0020-0190(92)90198-5","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.14232\/actacyb.21.4.2014.1","volume":"21","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. Acta Cybernetica 21(4), 507\u2013527 (2014)","journal-title":"Acta Cybernetica"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13089-2_1","volume-title":"Language and Automata Theory and Applications","author":"J Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Complexity in convex languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 1\u201315. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13089-2_1"},{"key":"12_CR4","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. Theoret. Comput. Sci. 470, 36\u201352 (2013). doi:10.1016\/j.tcs.2012.10.055","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"12_CR5","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). doi:10.1007\/s00224-013-9515-7","journal-title":"Theory Comput. Syst."},{"key":"12_CR6","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:10.1007\/978-3-642-25929-6_9"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Han, Y., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. In: McQuillan, I., Pighizzini, G. (eds.) DCFS 2010. EPTCS, vol. 31, pp. 189\u2013196 (2010). doi:10.4204\/EPTCS.31.21","DOI":"10.4204\/EPTCS.31.21"},{"issue":"1\u20132","key":"12_CR8","doi-asserted-by":"publisher","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). doi:10.3233\/FI-2009-0008","journal-title":"Fundam. Inform."},{"issue":"6","key":"12_CR9","doi-asserted-by":"publisher","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(6), 1087\u20131102 (2003). doi:10.1142\/S0129054103002199","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-40946-7_11","volume-title":"Implementation and Application of Automata","author":"M Hospod\u00e1r","year":"2016","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Nondeterministic complexity of operations on closed and ideal languages. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 125\u2013137. Springer, Cham (2016). doi:10.1007\/978-3-319-40946-7_11"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","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(2), 287\u2013298 (2005). doi:10.1016\/j.tcs.2004.04.011","journal-title":"Theoret. Comput. Sci."},{"issue":"7","key":"12_CR12","doi-asserted-by":"publisher","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. Internat. J. Found. Comput. Sci. 22(7), 1639\u20131653 (2011). doi:10.1142\/S0129054111008933","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). doi:10.1007\/978-3-319-09704-6_20"},{"key":"12_CR14","unstructured":"Jir\u00e1skov\u00e1, G., Olej\u00e1r, P.: State complexity of intersection and union of suffix-free languages and descriptional complexity. In: Bordihn, H., et al. (eds.) NCMA 2009, vol. 256, pp. 151\u2013166. Austrian Computer Society (2009). books.ocg.at"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2015). doi:10.1007\/978-3-319-19225-3_16"},{"key":"12_CR16","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":"12_CR17","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41\u2013110. Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:31:47Z","timestamp":1710343907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_12","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":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}