Finding patterns common to a set of strings, Journal of Computer and System Sciences, vol.21, pp.46-62, 1980. ,
Certain query answering on compressed string patterns: From streams to hyperstreams, Reachability Problems -12th International Conference, pp.117-132, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01846016
, Tree automata techniques and applications. Available online since, 1997.
Tree automata techniques and applications, 2007. ,
Context matching for compressed terms, Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS, pp.93-102, 2008. ,
Context unification is in PSPACE, Automata, Languages, and Programming -41st International Colloquium, ICALP, vol.8573, pp.244-255, 2014. ,
Encoding of the halting problem into the monster type & applications, Typed Lambda Calculi and Applications, 6th International Conference, vol.2701, pp.153-166, 2003. ,
A functional language for hyperstreaming XSLT, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00806343
editor, Logic, Meaning and Computation, vol.305, 2001. ,
Transforming XML streams with references, String Processing and Information Retrieval -22nd International Symposium, vol.9309, pp.33-45, 2015. ,
Satisfiability of word equations with constants is in PSPACE, J. ACM, vol.51, issue.3, pp.483-496, 2004. ,
Linear pattern matching of compressed terms and polynomial rewriting, Mathematical Structures in Computer Science, vol.28, issue.8, pp.1415-1450, 2018. ,
Deciding equivalence of finite tree automata, SIAM Journal on Computing, vol.19, issue.3, pp.424-437, 1990. ,
Probabilistic approach to the lambda definability for fourth order types, Electr. Notes Theor. Comput. Sci, vol.140, pp.41-54, 2005. ,