| 2007 | STACS | A First Investigation of Sturmian Trees. | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
| 2006 | MFCS | Crochemore Factorization of Sturmian and Other Infinite Words. | Jean Berstel, Alessandra Savelli |
| 2003 | FCT | Operations Preserving Recognizable Languages. | Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin |
| 2001 | ICSE | A Scalable Formal Method for Design and Automatic Checking of User Interfaces. | Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro |
| 2000 | MFCS | XML Grammars. | Jean Berstel, Luc Boasson |
| 1995 | DLT | Recent Results on Sturmian Words. | Jean Berstel |
| 1993 | MFCS | A Characterization of Sturmian Morphisms. | Jean Berstel, Patrice Sbold |
| 1989 | STACS | Properties of Infinite Words: Recent Result. | Jean Berstel |
| 1988 | ICALP | Zeta Functions of Recognizable Languages. | Jean Berstel, Christophe Reutenauer |
| 1986 | MFCS | Recent Results in the Theory of Rational Sets. | Jean Berstel, Jacques Sakarovitch |
| 1984 | STACS | Some Recent Results on Squarefree Words. | Jean Berstel |
| 1981 | MFCS | More about the "Geography" of Context-Free Languages. | Joffroy Beauquier, Jean Berstel |
| 1979 | ICALP | Sur les mots sans carr dfinis par un morphisme. | Jean Berstel |
| 1977 | FCT | Some Recent Results on Recognizable Formal Power Series. | Jean Berstel |
| 1974 | ICALP | Une suite decroissante de cnes rationnels. | Jean Berstel, Luc Boasson |
| 1972 | FOCS | On Sets of Numbers Recognized by Push-Down Automata | Jean Berstel |
| 1972 | ICALP | Sur la densit asymptotique de langages formels. | Jean Berstel |