{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:58:35Z","timestamp":1743130715723,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_17","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"198-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Ranges of Accepting State Complexities of Languages Resulting From Some Operations"],"prefix":"10.1007","author":[{"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.03.007","volume":"682","author":"D-J Cho","year":"2017","unstructured":"Cho, D.-J., Go\u010d, D., Han, Y.-S., Ko, S.-K., Palioudakis, A., Salomaa, K.: State complexity of permutation on finite languages over a binary alphabet. Theoret. Comput. Sci. 682, 67\u201378 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR3","unstructured":"Dassow, J.: On the number of accepting states of finite automata. J. Autom. Lang. Comb. 21(1\u20132), 55\u201367 (2016)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-60252-3_3","volume-title":"Descriptional Complexity of Formal Systems","author":"J Dassow","year":"2017","unstructured":"Dassow, J.: Descriptional complexity and operations \u2013 two non-classical cases. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 33\u201344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_3"},{"issue":"11","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.ic.2007.07.001","volume":"205","author":"V Geffert","year":"2007","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205(11), 1652\u20131670 (2007)","journal-title":"Inf. Comput."},{"key":"17_CR6","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Boston (1978)"},{"key":"17_CR7","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: DCFS 2005, pp. 170\u2013181 (2005)"},{"issue":"1\u20132","key":"17_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K Iwama","year":"2000","unstructured":"Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to $$n$$-state NFAs. Theoret. Comput. Sci. 237(1\u20132), 485\u2013494 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"17_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00891-5","volume":"301","author":"K Iwama","year":"2003","unstructured":"Iwama, K., Matsuura, A., Paterson, M.: A family of NFAs which need $$2^n-\\alpha $$ deterministic states. Theoret. Comput. Sci. 301(1\u20133), 451\u2013462 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0129054111008076","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G.: Magic numbers and ternary alphabet. Internat. J. Found. Comput. Sci. 22(2), 331\u2013344 (2011)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"17_CR11","unstructured":"Jir\u00e1skov\u00e1, G.: Personal communication (2017)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.05.008","volume":"449","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Reversal of binary regular languages. Theoret. Comput. Sci. 449, 85\u201392 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by Boolean automata. Theoret. Comput. Sci. 13, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-39310-5_25","volume-title":"Descriptional Complexity of Formal Systems","author":"J \u0160ebej","year":"2013","unstructured":"\u0160ebej, J.: Reversal on regular languages and descriptional complexity. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 265\u2013276. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39310-5_25"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41\u2013110. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/126537.126543","volume":"22","author":"S Yu","year":"1991","unstructured":"Yu, S., Zhuang, Q.: On the state complexity of intersection of regular languages. SIGACT News 22(3), 52\u201354 (1991)","journal-title":"SIGACT News"},{"key":"17_CR17","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 complexity of some basic operations on regular languages. Theoret. Comput. Sci. 125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"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-94812-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:53:58Z","timestamp":1709826838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","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":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}