{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:15Z","timestamp":1725888975485},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_5","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"65-76","source":"Crossref","is-referenced-by-count":0,"title":["On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages"],"prefix":"10.1007","author":[{"given":"Suna","family":"Bensch","sequence":"first","affiliation":[]},{"given":"Maia","family":"Hoeberechts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"5_CR1","first-page":"243","volume":"55","author":"S Aydin","year":"2003","unstructured":"Aydin, S., Bordihn, H.: Sequential versus parallel grammar formalisms with respect to measures of descriptional complexity. Fundam. Inf. 55, 243\u2013254 (2003)","journal-title":"Fundam. Inf."},{"key":"5_CR2","unstructured":"Bordihn, H.: \u00dcber den Determiniertheitsgrad reiner Versionen formaler Sprachen. Ph.D. thesis, Technische Universit\u00e4t \u201cOtto von Guericke\u201d Magdeburg (1992)"},{"key":"5_CR3","first-page":"133","volume-title":"Developments in Theoretical Computer Science","author":"H Bordihn","year":"1994","unstructured":"Bordihn, H.: On the degree of nondeterminism. In: Dassow, J., Kelemenova, A. (eds.) Developments in Theoretical Computer Science, pp. 133\u2013140. Gordon and Breach Science Publishers, Philadelphia (1994)"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing","author":"A Joshi","year":"1985","unstructured":"Joshi, A.: Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A Joshi","year":"1975","unstructured":"Joshi, A., Levi, L.S., Takahashi, M.: Tree adjunct grammars. J. Comput. Syst. Sci. 10, 136\u2013163 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR6","first-page":"203","volume":"73","author":"S Marcus","year":"2006","unstructured":"Marcus, S.: Mild context-sensitivity, after twenty years. Fundam. Inf. 73, 203\u2013204 (2006)","journal-title":"Fundam. Inf."},{"key":"5_CR7","unstructured":"Pollard, C.: Generalized phrase structure grammars, head grammars and natural language. Ph.D. thesis, Stanford University (1984)"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00985664","volume":"2","author":"G Rozenberg","year":"1973","unstructured":"Rozenberg, G.: Extension of tabled 0L systems and languages. Int. J. Comput. Inform. Sci. 2, 311\u2013336 (1973)","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0019-9958(73)80004-X","volume":"23","author":"G Rozenberg","year":"1973","unstructured":"Rozenberg, G.: T0L systems and languages. Inf. Control 23, 357\u2013381 (1973)","journal-title":"Inf. Control"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01191624","volume":"87","author":"K Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.: The equivalence of four extensions of context-free grammars. Math. Syst. Theory 87, 511\u2013546 (1994)","journal-title":"Math. Syst. Theory"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Weir, D., Vijay-Shanker, K., Joshi, A.: The relationship between tree adjoining grammars and head grammars. In: Proceedings of the 24th Annual Meeting of Computational Linguistics, New York, NY (1986)","DOI":"10.3115\/981131.981142"}],"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-319-60252-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T11:00:17Z","timestamp":1496401217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}