Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables
We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string patterns but also compressed patterns for unranked trees with tree and hedge variables. Regular inclusion for the latter is relevant to certain query answering on Xml streams with references.
KeywordsComputational complexity Patterns Trees Tree languages and tree automata
We are grateful to Sylvain Salvati for pointing out and helping to solve difficulties. This work was partially supported by a grant from CPER Nord-Pas de Calais/FEDER DATA Advanced data science and technologies 2015–2020.
- 3.Comon, H., et al.: TATA, October 2007. http://tata.gforge.inria.fr
- 4.Gascón, A., Godoy, G., Schmidt-Schauß, M.: Context matching for compressed terms. In: LICS 2008, USA, pp. 93–102. IEEE CS (2008)Google Scholar
- 6.Labath, P., Niehren, J.: A functional language for hyperstreaming XSLT. Technical report, INRIA Lille (2013)Google Scholar