Tree adjunct languages as integer set recognizers†
Somenath Biswas, Vijay K. Vaishnavi · International Journal of Computer Mathematics · 1979
This paper deals with certain characterizations of the sets of positive integers which when represented as strings on a finite alphabet, form tree adjunct languages, As the context free languages constitute a subfamily of tree adjunct languages, the results carry over to the former as well.