... Adjoining Grammars A Tree Adjoining Grammar (TAG) consists of a quintuple (N, ~ U {~}, I, A, S), where N is a finite set of nonterminal symbols, is a finite set of terminal symbols disjoint ... TAL Parsing in o(n 6) Time, to ap- pear in SIAM Journal on Computing, 1995. G. Satta, Tree Adjoining Grammar Parsing and Boolean Matrix Multiplication, to be presented in the 31st Meeting of ... the empty terminal string not in ~, I is a finite set of labelled initial trees, A is a finite set of auxiliary trees, S E N is the distinguished start symbol The trees in I U A are called...