{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:57:26Z","timestamp":1742918246891,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_18","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"265-272","source":"Crossref","is-referenced-by-count":1,"title":["On the Nonterminal Complexity of Tree Controlled Grammars"],"prefix":"10.1007","author":[{"given":"Gy\u00f6rgy","family":"Vaszil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02252350","volume":"19","author":"K. \u010culik II","year":"1977","unstructured":"\u010culik II, K., Maurer, H.: Tree controlled grammars. Computing\u00a019, 129\u2013139 (1977)","journal-title":"Computing"},{"key":"18_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-07675-0_3","volume-title":"Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"Dassow, J., P\u0103un, G., Salomaa, A.: Grammars with controlled derivations. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol.\u00a0II, pp. 101\u2013154. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Dassow, J., Stiebe, R., Truthe, B.: Generative capacity of subregularly tree controlled grammars. International Journal of Foundations of Computer Science 21 (2010)","key":"18_CR4","DOI":"10.1142\/S0129054110007520"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199542864.001.0001","volume-title":"Computing with Cells. Advances in Membrane Computing","author":"P. Frisco","year":"2009","unstructured":"Frisco, P.: Computing with Cells. Advances in Membrane Computing. Oxford University Press, New York (2009)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BFb0017154","volume-title":"Mathematical Foundations of Computer Science 1988","author":"V. Geffert","year":"1988","unstructured":"Geffert, V.: Context-Free-Like Forms for the Phrase Structure Grammars. In: Chytil, M.P., Janiga, L., Koubek, V. (eds.) MFCS 1988. LNCS, vol.\u00a0324, pp. 309\u2013317. Springer, Heidelberg (1988)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF02253054","volume":"21","author":"G. P\u0103un","year":"1979","unstructured":"P\u0103un, G.: On the generative capacity of tree controlled grammars. Computing\u00a021, 213\u2013220 (1979)","journal-title":"Computing"},{"volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)","key":"18_CR8"},{"key":"18_CR9","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-642-22600-7_23","volume-title":"DCFS 2011","author":"S. Turaev","year":"2011","unstructured":"Turaev, S., Dassow, J., Selamat, M.: Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol.\u00a06808, pp. 289\u2013300. Springer, Heidelberg (2011)"},{"issue":"41","key":"18_CR11","doi-asserted-by":"publisher","first-page":"5789","DOI":"10.1016\/j.tcs.2011.06.033","volume":"412","author":"S. Turaev","year":"2011","unstructured":"Turaev, S., Dassow, J., Selamat, M.: Nonterminal complexity of tree controlled grammars. Theoretical Computer Science\u00a0412(41), 5789\u20135795 (2011)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:53:07Z","timestamp":1558299187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}