Abstract
We show that the uniform membership problem of context-free 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 \(\epsilon \)-free indexed grammars is obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A.V.: Indexed grammars–an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)
Asveld, P.: Time and space complexity of inside-out macro languages. Int. J. Comput. Math. 10(1), 3–14 (1981)
Engelfriet, J., Schmidt, E.M.: IO and OI. J. Comput. Syst. Sci. 15(3), 328–353 (1977); and 16(1), 67–99 (1978)
Guessarian, I.: Pushdown tree automata. Math. Syst. Theory 16(1), 237–263 (1983)
Kozen, D.: Lower bounds for natural proof systems. In: Proc. 18th Symp. Foundations of Computer Science, pp. 254–266 (1977)
Lohrey, M.: On the parallel complexity of tree automata. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, p. 201. Springer, Heidelberg (2001)
Inaba, K., Maneth, S.: The complexity of tree transducer output languages. In: Proc. of FSTTCS 2008, pp. 244–255 (2008)
Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons (2003)
Rounds, W.C.: Mappings and grammars on trees. Theor. Comput. Syst. 4(3), 257–287 (1970)
Rounds, W.C.: Tree-oriented proofs of some theorems on context-free and indexed languages. In: Proc. 2nd ACM Symp. Theory of Comput., pp. 109–116 (1970)
Rounds, W.C.: Complexity of recognition in intermediate level languages. In: Proc. 14th Symp. Switching and Automata Theory, pp. 145–158 (1973)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)
Tanaka, S., Kasai, T.: The emptiness problem for indexed language is exponential-time complete. Syst. Comput. Jpn. 17(9), 29–37 (1986)
Yoshinaka, R.: An attempt towards learning semantics: Distributional learning of IO context-free tree grammars. In: Proc. of TAG+11, pp. 90–98 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Osterholzer, J. (2015). Complexity of Uniform Membership of Context-Free Tree Grammars. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-23021-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23020-7
Online ISBN: 978-3-319-23021-4
eBook Packages: Computer ScienceComputer Science (R0)