How to Win a Game with Features

We show, that the axiomatization of rational trees in the language of features given elsewhere is complete.
In contrast to other completeness proofs that have been given in this field,
we employ the method of Ehrenfeucht-Fraïssé Games,
which yields a much simpler proof.
The result extends previous results on complete axiomatizations
of rational trees in the language of constructor equations
or in a weaker feature language.