Abstract
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.
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
References
Angluin, D.: Finding patterns common to a set of strings. JCSS 21, 46–62 (1980)
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). https://doi.org/10.1007/978-3-030-00250-3_9
Comon, H., et al.: TATA, October 2007. http://tata.gforge.inria.fr
Gascón, A., Godoy, G., Schmidt-Schauß, M.: Context matching for compressed terms. In: LICS 2008, USA, pp. 93–102. IEEE CS (2008)
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). https://doi.org/10.1007/978-3-662-43951-7_21
Labath, P., Niehren, J.: A functional language for hyperstreaming XSLT. Technical report, INRIA Lille (2013)
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). https://doi.org/10.1007/978-3-319-23826-5_4
Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51(3), 483–496 (2004)
Schmidt-Schauß, M.: Linear pattern matching of compressed terms and polynomial rewriting. Math. Struct. Comput. Sci. 28(8), 1415–1450 (2018)
Seidl, H.: Deciding equivalence of finite tree automata. SIAM J. Comput. 19(3), 424–437 (1990)
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). https://doi.org/10.1007/978-94-010-0526-5_15
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). https://doi.org/10.1007/3-540-44904-3_11
Zaionc, M.: Probabilistic approach to the lambda definability for fourth order types. Electr. Notes Theoret. Comput. Sci. 140, 41–54 (2005)
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Boneva, I., Niehren, J., Sakho, M. (2019). Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-13435-8_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13434-1
Online ISBN: 978-3-030-13435-8
eBook Packages: Computer ScienceComputer Science (R0)