Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.
['Jürgen Dassow', 'Ralf Stiebe', 'Bianca Truthe']
GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS