Finding patterns common to a set of strings, Journal of Computer and System Sciences, vol.21, issue.1, pp.46-62, 1980. ,
DOI : 10.1016/0022-0000(80)90041-0
A new algorithm for normal dominance constraints, ACM-SIAM Symposium on Discrete Algorithms, pp.54-78, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00536536
Completion of rewrite systems with membership constraints, In Int .Coll. on Automata Languages and Progr. LNCS, vol.623, 1992. ,
DOI : 10.1007/3-540-55719-9_91
Ellipsis and higher-order unification, Linguistics and Philosophy, vol.8, issue.1, pp.399-452, 1991. ,
DOI : 10.1007/BF00630923
URL : http://arxiv.org/abs/cmp-lg/9503008
The constraint language for lambda structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-485, 2001. ,
DOI : 10.1023/A:1017964622902
URL : https://hal.archives-ouvertes.fr/inria-00536795
Well-nested parallelism constraints for ellipsis resolution, Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics , EACL '03, pp.115-122, 2003. ,
DOI : 10.3115/1067807.1067824
URL : https://hal.archives-ouvertes.fr/inria-00536541
Higher-Order Coloured Unification and natural language semantics, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1996. ,
DOI : 10.3115/981863.981864
URL : http://arxiv.org/abs/cmp-lg/9605004
Linear second-order unification, 7th Int. Conf. on Rewriting Techniques and Applications, pp.332-346, 1996. ,
DOI : 10.1007/3-540-61464-8_63
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.1987
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints, 11th Int. Conf. on Rewriting Techniques and Applications, pp.156-171, 2000. ,
DOI : 10.1007/10721975_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.8659
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP, Mathematics of the USSR-Sbornik, vol.32, issue.2, pp.129-198, 1977. ,
DOI : 10.1070/SM1977v032n02ABEH002376
The proper treatment of quantification in ordinary English, Approaches to Natural Language. Dordrecht, 1973. ,
Dominance Constraints in Context Unification, Logical Aspects of Computational Linguistics of LNAI, pp.199-218, 2001. ,
DOI : 10.1007/3-540-45738-0_12
URL : https://hal.archives-ouvertes.fr/inria-00536820
A uniform approach to underspecification and parallelism, 35th Meeting of the Association of Computational Linguistics, pp.410-417, 1997. ,
URL : https://hal.archives-ouvertes.fr/inria-00536821
Testing equivalence of morphisms on context-free languages, Proc. of the 2nd Annual European Symposium on Algorithms, pp.460-470, 1994. ,
DOI : 10.1007/BFb0049431
The Complexity of the Morphism Equivalence Problem for Context-Free Languages, 1995. ,
Satisfiability of word equations with constants is in PSPACE, 40th IEEE Found, pp.495-500, 1999. ,
Application of Lempel-Ziv encodings to the solution of word equations, 25th ICALP, pp.731-742, 1998. ,
DOI : 10.1007/BFb0055097
Deletion and logical form A decision algorithm for stratified context unification, Journal of Logic and Computation, vol.12, pp.929-953, 1976. ,
Solvability of Context Equations with Two Context Variables is Decidable, 16th Int. Conf. on Automated Deduction , LNAI, pp.67-81, 1999. ,
DOI : 10.1006/jsco.2001.0438