{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:02Z","timestamp":1760202542567},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_30","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"312-323","source":"Crossref","is-referenced-by-count":4,"title":["Descriptional Complexity of Bounded Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Malcher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","first-page":"193","volume":"8","author":"J. Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. Journal of Universal Computer Science\u00a08(2), 193\u2013234 (2002)","journal-title":"Journal of Universal Computer Science"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1137\/0304034","volume":"4","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Finite-turn pushdown automata. SIAM Journal on Control\u00a04(3), 429\u2013453 (1966)","journal-title":"SIAM Journal on Control"},{"key":"30_CR3","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading MA (1978)"},{"issue":"6","key":"30_CR4","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. International Journal of Foundations of Computer Science\u00a014(6), 1087\u20131102 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"30_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading MA (1979)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(83)90026-9","volume":"28","author":"A. Kelemenova","year":"1984","unstructured":"Kelemenova, A.: Complexity of Normal Form Grammars. Theoretical Computer Science\u00a028, 299\u2013314 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"30_CR7","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054105003406","volume":"16","author":"M. Kutrib","year":"2005","unstructured":"Kutrib, M.: The phenomenon of non-recursive trade-offs. International Journal of Foundations of Computer Science\u00a016(5), 957\u2013973 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"30_CR8","unstructured":"Malcher, A.: On recursive and non-recursive trade-offs between finite-turn pushdown automata. In: Descriptional Complexity of Formal Systems (DCFS 2005), Universit\u00e0 degli Studi di Milano, Rapporto Tecnico 06-05, pp. 215\u2013226 (2005)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of descriptions by automata, grammars, and formal systems. IEEE Symp. on Foundations of Computer Science, pp. 188\u2013191 (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1006\/jcss.2002.1855","volume":"65","author":"G. Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J., Wang, M.-W.: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. Journal of Computer and System Sciences\u00a065, 393\u2013414 (2002)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:34:21Z","timestamp":1558488861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}