EDT0L Structural Equivalence is Decidable

摘要

We reduce the structural equivalence problem for EDT0L grammars to deciding emptiness of the tree language recognized by a tree pushdown automaton. This implies that structural equivalence of known undecidability result for ET0L structural equivalence.