Tree adjunct kolam array languages

Tree Adjunct Kolam Array Grammars (TAKAG) are proposed to generate rectangular arrays of terminal symbols. These grammars have two phases of derivations as in kolam array grammars of Siromoney a at The notion of tree adjunction is made use of in their first phase of derivations. The family of Tree Adjunct Kolam Array Languages (TAKAL) is shown to properly include the family of context-free kolam array languages. The family of TAKAL's is closed under the operations of union and array eatenations and star. The families of linear and regular kolam array languages are shown to be proper subfamilies of the families of linear and one-sided linear TAKAL's. Key words: Chornsky grammars, adjunct languages, array languages. 1