| 2022 | LATIN | The Net Automaton of a Rational Expression. | Sylvain Lombardy, Jacques Sakarovitch |
| 2016 | LATIN | Trees and Languages with Periodic Signature. | Victor Marsault, Jacques Sakarovitch |
| 2014 | DLT | Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). | Victor Marsault, Jacques Sakarovitch |
| 2013 | DLT | Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. | Victor Marsault, Jacques Sakarovitch |
| 2010 | LATIN | Radix Cross-Sections for Length Morphisms. | Sylvain Lombardy, Jacques Sakarovitch |
| 2008 | MFCS | On the Decidability of Bounded Valuedness for Transducers. | Jacques Sakarovitch, Rodrigo de Souza |
| 2008 | STACS | On the decomposition of k-valued rational relations. | Jacques Sakarovitch, Rodrigo de Souza |
| 2007 | DLT | Finite Automata and the Writing of Numbers. | Jacques Sakarovitch |
| 2006 | CSR | Conjugacy and Equivalence of Weighted Automata and Functional Transducers. | Marie-Pierre Bal, Sylvain Lombardy, Jacques Sakarovitch |
| 2005 | ICALP | On the Equivalence of -Automata. | Marie-Pierre Bal, Sylvain Lombardy, Jacques Sakarovitch |
| 2004 | LATIN | How Expressions Can Code for Automata. | Sylvain Lombardy, Jacques Sakarovitch |
| 2002 | LATIN | Star Height of Reversible Languages and Universal Automata. | Sylvain Lombardy, Jacques Sakarovitch |
| 2002 | MFCS | Derivation of Rational Expressions with Multiplicity. | Sylvain Lombardy, Jacques Sakarovitch |
| 2000 | DLT | On the Star Height of Rational Languages: A New Presentation for Two Old Results. | Sylvain Lombardy, Jacques Sakarovitch |
| 2000 | LATIN | Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. | Marie-Pierre Bal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch |
| 1992 | LATIN | The "Last" Decision Problem for Rational Trace Languages. | Jacques Sakarovitch |
| 1991 | STACS | Rational Ralations with Bounded Delay. | Christiane Frougny, Jacques Sakarovitch |
| 1986 | MFCS | Recent Results in the Theory of Rational Sets. | Jean Berstel, Jacques Sakarovitch |
| 1986 | MFCS | One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. | Fabienne Romian, Jacques Sakarovitch |
| 1976 | ICALP | Sur les monodes syntactiques des langages algbriques dterministes. | Jacques Sakarovitch |
| 1976 | MFCS | An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. | Jacques Sakarovitch |