We show that the "dominance charts" proposed by Koller and Thater (2005b) can be naturally seen as regular tree grammars; using their algorithm, classical underspecified descriptions (dominance graphs) can be translated into RTGs that describe the same sets of readings.
rTGs are trivially expressively complete because every finite tree language is also regular.