On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata

Zhibo Deng, Vladimir A. Zakharov

We present an efficient algorithm for checking language equivalence of states in top-down deterministic finite tree automata (DFTAs). Unlike string automata, tree automata operate…