{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:50Z","timestamp":1760202470237},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0304-3975(92)90124-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"235-261","source":"Crossref","is-referenced-by-count":38,"title":["A geometric hierarchy beyond context-free languages"],"prefix":"10.1016","volume":"104","author":[{"given":"David J.","family":"Weir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90124-X_BIB1","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","article-title":"Indexed grammars \u2014 An extension to context-free grammars","volume":"15","author":"Aho","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90124-X_BIB2","series-title":"Quarterly Prog. Rept. No. 65","first-page":"187","article-title":"Context-free grammars and pushdown storage","author":"Chomsky","year":"1962"},{"key":"10.1016\/0304-3975(92)90124-X_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00630918","article-title":"The complexity of the vocabulary of bambara","volume":"8","author":"Culy","year":"1985","journal-title":"Linguist. and Philosophy"},{"key":"10.1016\/0304-3975(92)90124-X_BIB4","series-title":"Natural Language Parsing and Linguistic Theories","first-page":"69","article-title":"Applicability of indexed grammars to natural languages","author":"Gazdar","year":"1988"},{"key":"10.1016\/0304-3975(92)90124-X_BIB5","series-title":"Technical Report 82-28","article-title":"Pushdown tree automata","author":"Guessarian","year":"1982"},{"issue":"1","key":"10.1016\/0304-3975(92)90124-X_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0022-0000(75)80019-5","article-title":"Tree adjunct grammars","volume":"10","author":"Joshi","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90124-X_BIB7","series-title":"Ph.D. Thesis","article-title":"Generalized context-free languages","author":"Khabbaz","year":"1972"},{"key":"10.1016\/0304-3975(92)90124-X_BIB8","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/S0022-0000(74)80052-8","article-title":"A geometric hierarchy of languages","volume":"8","author":"Khabbaz","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90124-X_BIB9","unstructured":"M. Palis and S. Shende, A pumping lemma for the control language hierarchy, under review."},{"key":"10.1016\/0304-3975(92)90124-X_BIB10","unstructured":"M. Palis and S. Shende, Upper bounds on recognition of a hierarchy of non-context-free languages, to appear in Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90124-X_BIB11","series-title":"Ph.D. Thesis","article-title":"Generalized phrase structure grammars, head grammars and natural language","author":"Pollard","year":"1984"},{"key":"10.1016\/0304-3975(92)90124-X_BIB12","series-title":"Mathematics of Language","first-page":"293","article-title":"Formal properties of head grammars","author":"Roach","year":"1987"},{"key":"10.1016\/0304-3975(92)90124-X_BIB13","series-title":"Ph.D. Thesis","article-title":"Computational feasibility of some constrained formalisms for natural language","author":"Shende","year":"1990"},{"key":"10.1016\/0304-3975(92)90124-X_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00630917","article-title":"Evidence against the context-freeness of natural language","volume":"8","author":"Shieber","year":"1985","journal-title":"Linguist. and Philosophy"},{"key":"10.1016\/0304-3975(92)90124-X_BIB15","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF00134555","article-title":"Combinatory grammars and parasitic gaps","volume":"5","author":"Steedman","year":"1987","journal-title":"Natural Language and Linguistic Theory"},{"key":"10.1016\/0304-3975(92)90124-X_BIB16","doi-asserted-by":"crossref","first-page":"268","DOI":"10.2307\/414385","article-title":"Dependency and coordination in the grammar of Dutch and English","volume":"61","author":"Steedman","year":"1985","journal-title":"Language"},{"key":"10.1016\/0304-3975(92)90124-X_BIB17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/00207167708803138","article-title":"The complexity of the membership problem for some extensions of context-free languages","volume":"6","author":"Sudborough","year":"1977","journal-title":"Internat. J. Computer Math."},{"key":"10.1016\/0304-3975(92)90124-X_BIB18","series-title":"Ph.D. Thesis","article-title":"A study of tree adjoining grammars","author":"Vijay-Shanker","year":"1987"},{"key":"10.1016\/0304-3975(92)90124-X_BIB19","first-page":"202","article-title":"Tree adjoining and head wrapping","author":"Vijay-Shanker","year":"1986","journal-title":"Proc. 11th Internat. Conf. on Comput. Ling."},{"key":"10.1016\/0304-3975(92)90124-X_BIB20","doi-asserted-by":"crossref","first-page":"104","DOI":"10.3115\/981175.981190","article-title":"Characterizing structural descriptions produced by various grammatical formalisms","author":"Vijay-Shanker","year":"1987","journal-title":"Proc. 25th meeting Assoc. Comput. Ling."},{"key":"10.1016\/0304-3975(92)90124-X_BIB21","series-title":"Ph.D. Thesis","article-title":"Characterizing mildly context-sensitive grammar formalisms","author":"Weir","year":"1988"},{"key":"10.1016\/0304-3975(92)90124-X_BIB22","doi-asserted-by":"crossref","first-page":"278","DOI":"10.3115\/982023.982057","article-title":"Combinatory categorial grammars: Generative power and relationship to linear context-free rewriting systems","author":"Weir","year":"1988","journal-title":"Proc. 26th meeting Assoc. Comput. Ling."},{"key":"10.1016\/0304-3975(92)90124-X_BIB23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(84)90023-9","article-title":"Linear indexed languages","volume":"32","author":"Duske","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90124-X_BIB24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01704910","article-title":"Iterated linear control and iterated one-turn pushdowns","volume":"19","author":"Vogler","year":"1986","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290124X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290124X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:36Z","timestamp":1555129236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290124X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["030439759290124X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90124-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}