1Two Recent Developments in Tree Adjoining Grammars: Semantics and Efficient Processinginvestigated deterministic parsing of the class of context-sensitive languages. However they used Turing machines which recognize...
3Efficient Parsing of Well-Nested Linear Context-Free Rewriting SystemsVillemonte de la Clergerie. 2002. Parsing mildly context-sensitive languages with thread automata. In 19th International Conference...
4Some Computational Properties Of Tree Adjoining GrammarsIt can be shown that TAG's cannot generate all context-sensitive languages \[Joehi ,1984\]. Although TAG's are more powerful...