Upper bounds on recognition of a hierarchy of non-context-free languages
Theoretical Computer Science
A geometric hierarchy beyond context-free languages
Theoretical Computer Science
Handbook of formal languages, vol. 3
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
| Hi-index | 0.00 |
We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends Tree-Adjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition to the three levels TAG already employs. While extending the descriptive power minimally, the additional level of decomposition allows us to obtain a uniform account of a range of phenomena that has heretofore been difficult to encompass, an account that employs unitary elementary structures and eschews synchronized derivation operations, and which is, in many respects, closer to the spirit of the intuitions underlying TAG-based linguistic theory than previously considered extensions to TAG.