Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

  • Iovka Boneva
  • Joachim Niehren
  • Momar SakhoEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11417)


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.


Computational 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.


  1. 1.
    Angluin, D.: Finding patterns common to a set of strings. JCSS 21, 46–62 (1980)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Boneva, I., Niehren, J., Sakho, M.: Certain query answering on compressed string patterns: from streams to hyperstreams. In: Potapov, I., Reynier, P.-A. (eds.) RP 2018. LNCS, vol. 11123, pp. 117–132. Springer, Cham (2018). Scholar
  3. 3.
    Comon, H., et al.: TATA, October 2007.
  4. 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
  5. 5.
    Jeż, A.: Context unification is in PSPACE. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 244–255. Springer, Heidelberg (2014). Scholar
  6. 6.
    Labath, P., Niehren, J.: A functional language for hyperstreaming XSLT. Technical report, INRIA Lille (2013)Google Scholar
  7. 7.
    Maneth, S., Ordóñez, A., Seidl, H.: Transforming XML streams with references. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 33–45. Springer, Cham (2015). Scholar
  8. 8.
    Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3), 483–496 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Schmidt-Schauß, M.: Linear pattern matching of compressed terms and polynomial rewriting. Math. Struct. Comput. Sci. 28(8), 1415–1450 (2018)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput. 19(3), 424–437 (1990)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Loader, R.: The undecidability of \(\uplambda \)-definability. In: Anderson, C.A., Zelëny, M. (eds.) Logic, Meaning and Computation. SYLI, vol. 305, pp. 331–342. Springer, Dordrecht (2001). Scholar
  12. 12.
    Joly, T.: Encoding of the halting problem into the monster type and applications. In: Hofmann, M. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 153–166. Springer, Heidelberg (2003). Scholar
  13. 13.
    Zaionc, M.: Probabilistic approach to the lambda definability for fourth order types. Electr. Notes Theoret. Comput. Sci. 140, 41–54 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Université de LilleLilleFrance
  2. 2.InriaLilleFrance

Personalised recommendations