| 2020 | LATA | $\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. | Alexis Bs, Christian Choffrut |
| 2016 | DLT | Both Ways Rational Functions. | Christian Choffrut, Bruno Guillon |
| 2014 | MFCS | An Algebraic Characterization of Unary Two-Way Transducers. | Christian Choffrut, Bruno Guillon |
| 2013 | DLT | Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. | Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro |
| 2010 | LATA | On the Expressive Power of FO[ + ]. | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
| 2009 | CSR | Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. | Christian Choffrut, Juhani Karhumki |
| 2009 | DLT | The Inclusion Problem of Context-Free Languages: Some Tractable Cases. | Alberto Bertoni, Christian Choffrut, Roberto Radicioni |
| 2006 | DLT | Context-Free Grammars and XML Languages. | Alberto Bertoni, Christian Choffrut, Beatrice Palano |
| 2004 | DLT | On the Maximum Coefficients of Rational Formal Series in Commuting Variables. | Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
| 2004 | STACS | Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati |
| 2001 | DLT | Elementary Theory of Ordinals with Addition and Left Translation by omega. | Christian Choffrut |
| 2000 | DLT | The Theory of Rational Relations on Transfinite Strings. | Christian Choffrut, Serge Grigorieff |
| 1998 | MFCS | Equations in Transfinite Strings. | Christian Choffrut, Sndor Horvth |
| 1997 | FCT | Generalized Rational Relations and their Logical Definability. | Christian Choffrut, Leucio Guerra |
| 1997 | MFCS | Distances Between Languages and Reflexivity of Relations. | Christian Choffrut, Giovanni Pighizzini |
| 1993 | STACS | On the Logical Definability of Some Rational Trace Languages. | Christian Choffrut, Leucio Guerra |
| 1992 | MFCS | Rational Transductions and Complexity of Counting Problems. | Christian Choffrut, Massimiliano Goldwurm |
| 1990 | ICALP | Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. | Christian Choffrut |
| 1987 | ICALP | A Star-Height Problem in Free Monoids with Partial Communications. | Christian Choffrut, Christine Duboc |
| 1986 | ICALP | Counting with Rational Functions. | Christian Choffrut, Marcel Paul Schtzenberger |
| 1986 | STACS | Dcomposition de Fonctions Rationnelles. | Christian Choffrut, Marcel Paul Schtzenberger |
| 1984 | STACS | On Extendibility of Unavoidable Sets. | Christian Choffrut, Karel Culk II |
| 1983 | ICALP | Test Sets for Morphisms with Bounded Delay. | Christian Choffrut, Juhani Karhumki |
| 1979 | ICALP | A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. | Christian Choffrut |
| 1976 | MFCS | Strongly Connected G-S-M Mappings Preserving Conjugation. | Christian Choffrut |
| 1972 | ICALP | Transducteurs conservant l'imprimitivit du langage d'entre. | Christian Choffrut |