{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:06Z","timestamp":1759638126618},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_26","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T21:33:15Z","timestamp":1371159195000},"page":"277-288","source":"Crossref","is-referenced-by-count":13,"title":["Kleene Star on Unary Regular Languages"],"prefix":"10.1007","author":[{"given":"Krist\u00edna","family":"\u010cevorov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","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.\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C. Nicaud","year":"1999","unstructured":"Nicaud, C.: Average state complexity of operations on unary automata. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"26_CR3","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. Theor. Comput. Sci.\u00a0237(1-2), 485\u2013494 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR4","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. Int. J. Found. Comput. Sci.\u00a022(2), 331\u2013344 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"11","key":"26_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.\u00a0205(11), 1652\u20131670 (2007)","journal-title":"Inf. Comput."},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1142\/S0129054105003455","volume":"16","author":"L. Zijl van","year":"2005","unstructured":"van Zijl, L.: Magic numbers for symmetric difference NFAs. Int. J. Found. Comput. Sci.\u00a016(5), 1027\u20131038 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-85780-8_34","volume-title":"Developments in Language Theory","author":"G. Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G.: On the state complexity of complements, stars, and reversals of regular languages. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 431\u2013442. Springer, Heidelberg (2008)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1090\/S0002-9939-1956-0091961-5","volume":"7","author":"J.B. Roberts","year":"1956","unstructured":"Roberts, J.B.: Note on linear forms. Proceedings of the American Mathematical Society\u00a07(3), 465\u2013469 (1956)","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39310-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:44:30Z","timestamp":1557791070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}