{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:48:52Z","timestamp":1775404132595,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540403913","type":"print"},{"value":"9783540449775","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_14","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"148-157","source":"Crossref","is-referenced-by-count":28,"title":["State Complexity of Basic Operations on Nondeterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"State complexity of basic operations on.nite languages","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., \u010culik, K., Salomaa, K., and Yu, S. State complexity of basic operations on.nite languages. Fourth International Workshop on Implementing Automata, LNCS 2214, pp. 60\u201370."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., and Yu, S. Minimal cover-automata for.nite languages. Theoret. Comput. Sci. 267 (2001), 3\u201316.","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0890-5401(90)90053-K","volume":"86","author":"J. Goldstine","year":"1990","unstructured":"Goldstine, J., Kintala, C., and Wotschke, D. On measuring nondeterminism in regular languages. Inform. Comput. 86 (1990), 179\u2013194.","journal-title":"Inform. Comput"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0890-5401(92)90014-7","volume":"100","author":"J. Goldstine","year":"1992","unstructured":"Goldstine, J., Leung, H., and Wotschke, D. On the relation between ambiguity and nondeterminism in.nite automata. Inform. Comput. 100 (1992), 261\u2013270.","journal-title":"Inform. Comput"},{"key":"14_CR5","volume-title":"Introduction to Automata Theory, Language, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E. and Ullman, J. D. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading, Massachusetts, 1979."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00263994","volume":"13","author":"C. M. Kintala","year":"1980","unstructured":"Kintala, C. M. and Wotschke, D. Amounts of nondeterminism in.nite automata. Acta Inf. 13 (1980), 199\u2013204.","journal-title":"Acta Inf."},{"key":"14_CR7","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 (1981), 323\u2013330.","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BFb0028556","volume-title":"STACS 1998","author":"C. Mereghetti","year":"1998","unstructured":"Mereghetti, C. and Pighizzini, G. Optimal simulations between unary automata. STACS 1998, LNCS 1373, 1998, pp. 139\u2013149."},{"key":"14_CR9","unstructured":"Mereghetti, C. and Pighizzini, G. Unary automata simulations and cyclic languages. International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, 1999, pp. 145\u2013153."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Meyer, A. R. and Fischer, M. J. Economy of description by automata, grammars, and formal systems. IEEE Symposium SWAT 1971, pp. 188\u2013191.","DOI":"10.1109\/SWAT.1971.11"},{"key":"14_CR11","first-page":"177","volume":"2","author":"K. Salomaa","year":"1997","unstructured":"Salomaa, K. and Yu, S. NFA to DFA transformation for.nite languages over arbitrary alphabets. J. Aut., Lang. and Comb. 2 (1997), 177\u2013186.","journal-title":"J. Aut., Lang. and Comb"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Yu, S. Regular languages. In Rozenberg, G. and Salomaa, A. (eds.), Handbook of Formal Languages I. Springer, 1997, chapter 2, pp. 41\u2013110.","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"14_CR13","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S. State complexity of regular languages. J. Aut., Lang. and Comb. 6 (2001), 221\u2013234.","journal-title":"J. Aut., Lang. and Comb."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/126537.126543","volume":"22","author":"S. Yu","year":"1991","unstructured":"Yu, S. and Zhuang, Q. On the state complexity of intersection of regular languages. SIGACT News 22.3 (1991), 52\u201354.","journal-title":"SIGACT News"},{"key":"14_CR15","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., and Salomaa, K. The state complexities of some basic operations on regular languages. Theoret. Comput. Sci. 125 (1994), 315\u2013328.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T02:09:59Z","timestamp":1550974199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}