{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:20:01Z","timestamp":1777105201906,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316227","type":"print"},{"value":"9783642316234","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_11","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T01:03:34Z","timestamp":1341795814000},"page":"141-154","source":"Crossref","is-referenced-by-count":3,"title":["Production Complexity of Some Operations on Context-Free Languages"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronny","family":"Harbich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K., Salomaa, K., Yu, S.: State Complexity of Basic Operations on Finite Languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"key":"11_CR2","first-page":"35","volume":"83","author":"J. Dassow","year":"2008","unstructured":"Dassow, J., Stiebe, R.: Nonterminal Complexity of Some Operations on Context-Free Languages. Fundamenta Informaticae\u00a083, 35\u201349 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"11_CR3","unstructured":"Domaratzki, M., Salomaa, K.: Transition complexity of language operations. In: Proc. Intern. Workshop Descriptional Complexity of Formal Systems 2006, New Mexico State Univ. Las Cruces, pp. 141\u2013152 (2006)"},{"key":"11_CR4","unstructured":"Ellul, K.: Descriptional complexity measures of regular languages. Master Thesis, University of Waterloo (2002)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0019-9958(69)90055-2","volume":"14","author":"J. Gruska","year":"1969","unstructured":"Gruska, J.: Some classifications of context-free languages. Information and Control\u00a014, 152\u2013179 (1969)","journal-title":"Information and Control"},{"key":"11_CR6","unstructured":"Gruska, J.: Generation and approximation of finite and infinite languages. In: Internat. Symp. Summer School Math. Found. Comp. Sci., Warsaw, pp. 1\u20137 (1972)"},{"key":"11_CR7","first-page":"213","volume":"8","author":"J. Gruska","year":"1972","unstructured":"Gruska, J.: On the size of context-free grammars. Kybernetika\u00a08, 213\u2013218 (1972)","journal-title":"Kybernetika"},{"key":"11_CR8","unstructured":"Gruska, J.: Descriptional complexity of context-free languages. In: Proc. Math. Found. Comp. Sci., Strebske Pleso, pp. 71\u201383 (1973)"},{"key":"11_CR9","unstructured":"Harbich, R.: Beschreibungskomplexit\u00e4t kontextfreier Sprachen bez\u00fcglich der AFL-Operationen. Dissertation, Otto-von-Guericke-Universit\u00e4t Magdeburg, Fakult\u00e4t f\u00fcr Informatik (2012)"},{"key":"11_CR10","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. Intern. J. Found. Comp. Sci.\u00a014, 1087\u20131102 (2003)","journal-title":"Intern. J. Found. Comp. Sci."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-30500-2_17","volume-title":"Implementation and Application of Automata","author":"J. Jir\u00e1sek","year":"2005","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G., Szabari, A.: State Complexity of Concatenation and Complementation of Regular Languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"key":"11_CR12","unstructured":"Jiraskova, G., Okhotin, A.: State Complexity of cyclic shift. In: Proc. Descriptional Complexity of Formal Systems, Univ. Milano, pp. 182\u2013193 (2005)"},{"key":"11_CR13","first-page":"203","volume":"18","author":"G. P\u0103un","year":"1976","unstructured":"P\u0103un, G.: On the smallest number of nonterminals required to generate a context-free language. Mathematica\u00a018, 203\u2013208 (1976)","journal-title":"Mathematica"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a0I\u2013III. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"key":"11_CR15","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Automata, Languages and Combinatorics\u00a06, 221\u2013234 (2001)","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"11_CR16","first-page":"142","volume":"76","author":"S. Yu","year":"2002","unstructured":"Yu, S.: State complexity of finite and infinite regular languages. Bulletin of the EATCS\u00a076, 142\u2013152 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"11_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. Theor. Comp. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theor. Comp. Sci."}],"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-31623-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:40:33Z","timestamp":1620114033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}