We show that the uniform membership problem of contextfree tree grammars is PSPACE-complete. The proof of the upper bound is by construction of an equivalent pushdown tree automaton representable in polynomial space.With this technique, we also give an alternative proof that the respective non-uniform membership problem is in NP. A corollary for uniform membership of ε-free indexed grammars is obtained.
CITATION STYLE
Osterholzer, J. (2015). Complexity of uniform membership of context-free tree grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9270, pp. 176–188). Springer Verlag. https://doi.org/10.1007/978-3-319-23021-4_16
Mendeley helps you to discover research relevant for your work.