{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:02:41Z","timestamp":1743037361800,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_34","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"431-442","source":"Crossref","is-referenced-by-count":12,"title":["On the State Complexity of Complements, Stars, and Reversals of Regular Languages"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Berman, P., Lingas, A.: On the complexity of regular languages in terms of finite automata. Technical Report 304, Polish Academy of Sciences (1977)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.C. Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett.\u00a043, 185\u2013190 (1992)","journal-title":"Inform. Process. Lett."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J.C. Birget","year":"1993","unstructured":"Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci.\u00a0119, 267\u2013291 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR4","first-page":"162","volume-title":"9th International Workshop on Descriptional Complexity of Formal Systems","author":"J. Dassow","year":"2007","unstructured":"Dassow, J., Stiebe, R.: Nonterminal complexity of some operations on context-free languages. In: Geffert, V., Pighizzini, G. (eds.) 9th International Workshop on Descriptional Complexity of Formal Systems, pp. 162\u2013169. P. J. \u0160af\u00e1rik University of Ko\u0161ice, Slovakia (2007)"},{"key":"34_CR5","first-page":"23","volume-title":"7th International Workshop on Descriptional Complexity of Formal Systems","author":"V. Geffert","year":"2005","unstructured":"Geffert, V. (Non)determinism and the size of one-way finite automata. In: Mereghetti, C., Palano, B., Pighizzini, G., Wotschke, D. (eds.) 7th International Workshop on Descriptional Complexity of Formal Systems, pp. 23\u201337. University of Milano, Italy (2005)"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11821069_36","volume-title":"Mathematical Foundations of Computer Science 2006","author":"V. Geffert","year":"2006","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 412\u2013423. Springer, Heidelberg (2006)"},{"key":"34_CR7","doi-asserted-by":"publisher","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.\u00a059, 75\u201377 (1996)","journal-title":"Inform. Process. Lett."},{"key":"34_CR8","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. Internat. J. Found. Comput. Sci.\u00a014, 1087\u20131102 (2003)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"34_CR9","first-page":"170","volume-title":"7th International Workshop on Descriptional Complexity of Formal Systems","author":"M. Hricko","year":"2005","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: Mereghetti, C., Palano, B., Pighizzini, G., Wotschke, D. (eds.) 7th International Workshop on Descriptional Complexity of Formal Systems, pp. 170\u2013181. University of Milano, Italy (2005)"},{"key":"34_CR10","first-page":"519","volume":"7","author":"J. Hromkovi\u010d","year":"2002","unstructured":"Hromkovi\u010d, J.: Descriptional complexity of finite automata: Concepts and open problems. J.\u00a0Autom. Lang. Comb.\u00a07, 519\u2013531 (2002)","journal-title":"J.\u00a0Autom. Lang. Comb."},{"key":"34_CR11","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.\u00a0237, 485\u2013494 (2000); Preliminary version In:Bozapalidis, S. (ed.) 3rd International Conference on Developments in Language Theory. Aristotle University of Thessaloniki (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR12","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                    n\n                  \u2009\u2212\u2009\u03b1 deterministic states. Theoret. Comput. Sci.\u00a0301, 451\u2013462 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-44683-4_37","volume-title":"Mathematical Foundations of Computer Science 2001","author":"G. Jir\u00e1skov\u00e1","year":"2001","unstructured":"Jir\u00e1skov\u00e1, G.: Note on minimal finite automata. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 421\u2013431. Springer, Heidelberg (2001)"},{"key":"34_CR14","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.\u00a0330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1142\/S0129054105003133","volume":"16","author":"J. Jir\u00e1sek","year":"2005","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G., Szabari, A.: State complexity of concatenation and complementation. Internat. J. Found. Comput. Sci.\u00a016, 511\u2013529 (2005)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-73208-2_25","volume-title":"Developments in Language Theory","author":"J. Jir\u00e1sek","year":"2007","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G., Szabari, A.: Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 254\u2013265. Springer, Heidelberg (2007)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: 10th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"34_CR18","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":"34_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages, ch. 2","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 2, vol.\u00a0I, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"key":"34_CR20","first-page":"270","volume":"72","author":"S. Yu","year":"2000","unstructured":"Yu, S.: A renaissance of automata theory? Bull. Eur. Assoc. Theor. Comput. Sci.\u00a072, 270\u2013272 (2000)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"34_CR21","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.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1142\/S0129054105003455","volume":"16","author":"L. Zijl","year":"2005","unstructured":"Zijl, L.: Magic numbers for symmetric difference NFAs. Internat. J. Found. Comput. Sci.\u00a016, 1027\u20131038 (2005)","journal-title":"Internat. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:19:52Z","timestamp":1676575192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}