Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination