Rewriting

• Langages formels et réécriture.
  Survol en français
  (Exposé à l'école de printemps d'informatique théorique de Font-Romeu, 1993).
  English version in: Term-rewriting, Font-Romeu 1993, advanced course, pages 75-94, LNCS 909 .
• On the rational subsets of the free group.
  (In Acta Informatica 33, p.281-296, 1996).
• A polynomial algorithm testing partial confluence of basic semi-Thue systems.
  (In TCS 192,p. 55-75,1998).
  (Preliminar version in proceedings RTA'95,LNCS 914,p.194-209).
• On the termination-problem for one-rule semi-Thue systems.
  (Shorter version in proceedings RTA'96, LNCS 1103, p.302-316).
• Decision problems for semi-Thue systems with a few rules.
  Joint work with Y. Matiyasevich.
  (Short version in proceedings LICS'96,IEEE computer press, p.523-531).
• Bottom-up rewriting is inverse recognizability preserving.
  Joint work with I. Durand.
  Preprint with full proofs.
  Short version, Proceedings RTA'07.
  Talk at RTA'07.
  Talk at the LIF seminar, 20/05/09.
  
• Termination of linear bounded term rewriting systems.
  Joint work with I. Durand and M. Sylvestre
  Proceedings RTA'10.