1. Opérations polynomiales et hiérarchies de concaténation;Arfi;Theoret. Comput. Sci.,1991
2. Context-free languages and pushdown automata;Autebert,1997
3. F. Baader, R. Küsters, Solving linear equations over regular languages, Proc. of the 15th Internat. Workshop on Unification, UNIF 2001, Siena, Italy, June 18–19, 2001, pp. 27–31.
4. F. Baader, R. Küsters, Unification in a description logic with transitive closure of rules, Working Notes of the 2001 Internat. Description Logics Workshop, DL 2001, Stanford, USA, August 1–3, 2001.
5. Unification of concept terms in description logic;Baader;J. Symbolic Comput.,2001