Transducteurs conservant l'imprimitivité du langage d'entrée. - Christian Choffrut (ICALP, 1972)

Strongly Connected G-S-M Mappings Preserving Conjugation. - Christian Choffrut (MFCS, 1976)

Applications séquentielles permutables. - Christian Choffrut (J. Inf. Process. Cybern., 1977)

Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. - Christian Choffrut (Theor. Comput. Sci., 1977)

Sur Certaines Applications Séquentielles Numériques - Christian Choffrut (Inf. Control., 1977)

Sur les traductions reconnaissables. - Christian Choffrut (RAIRO Theor. Informatics Appl., 1978)

A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. - Christian Choffrut (ICALP, 1979)

Prefix-Preservation fo Rational Partial Functions Is Decidable. - Christian Choffrut (Theoretical Computer Science, 1981)

A Closure Property of Deterministic Context-Free Languages. - Christian Choffrut (Inf. Process. Lett., 1981)

Folding of the Plane and the Design of Systolic Arrays. - Christian Choffrut; Karel Culík II (Inf. Process. Lett., 1983)

Properties of Finite and Pushdown Transducers. - Christian Choffrut; Karel Culík II (SIAM J. Comput., 1983)

On Real-Time Cellular Automata and Trellis Automata. - Christian Choffrut; Karel Culík II (Acta Informatica, 1984)

On extendibility of unavoidable sets. - Christian Choffrut; Karel Culík II (Discret. Appl. Math., 1984)

Test sets for morphisms with bounded delay. - Christian Choffrut; Juhani Karhumäki (Discret. Appl. Math., 1985)

An Introduction to Automata Network Theory. - Christian Choffrut (Automata Networks, 1986)

Décomposition de Fonctions Rationnelles. - Christian Choffrut; Marcel Paul Schützenberger (STACS, 1986)

A Star-Height Problem in Free Monoids with Partial Communications. - Christian Choffrut; Christine Duboc (ICALP, 1987)

Counting with Rational Functions. - Christian Choffrut; Marcel Paul Schützenberger (Theor. Comput. Sci., 1988)

Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. - Christian Choffrut (ICALP, 1990)

An Optimal Algorithm for building the Boyer-Moore automaton. - Christian Choffrut (Bull. EATCS, 1990)

Conjugacies. - Christian Choffrut (Bull. EATCS, 1991)

Rational Relations and Ratonal Series. - Christian Choffrut (Theor. Comput. Sci., 1992)

Conjugacy in Free Inverse Monoids. - Christian Choffrut (Int. J. Algebra Comput., 1993)

On the Starheight of Some Rational Subsets Closed under Partial Commutations - Christian Choffrut (Inf. Comput., 1993)

On Boyer-Moore Automata. - Ricardo A. Baeza-Yates; Christian Choffrut; Gaston H. Gonnet (Algorithmica, 1994)

Bijective Sequential Mappings of a Free Monoid Onto Another. - Christian Choffrut (RAIRO Theor. Informatics Appl., 1994)

Combinatorics in Trace Monoids I. - Christian Choffrut (The Book of Traces, 1995)

Logical Definability of Some Rational Trace Languages. - Christian Choffrut; Leucio Guerra (Math. Syst. Theory, 1995)

Rational Transductions and Complexity of Counting Problems. - Christian Choffrut; Massimiliano Goldwurm (Math. Syst. Theory, 1995)

Constructing Sequential Bijections. - Christophe Prieur 002; Christian Choffrut; Michel Latteux (Structures in Logic and Computer Science, 1997)

Generalized Rational Relations and their Logical Definability. - Christian Choffrut; Leucio Guerra (FCT, 1997)

A Note on Decidability Questions on Presentations of Word Semigroups. - Christian Choffrut; Tero Harju; Juhani Karhumäki (Theor. Comput. Sci., 1997)

Combinatorics of Words. - Christian Choffrut; Juhani Karhumäki (Handbook of Formal Languages (1), 1997)

Equations in Transfinite Strings. - Christian Choffrut; Sándor Horváth (MFCS, 1998)

Commutativity in Free Inverse Monoids. - Christian Choffrut; Flavio D'Alessandro (Theor. Comput. Sci., 1998)

Uniformization of Rational Relations. - Christian Choffrut; Serge Grigorieff (Jewels are Forever, 1999)

Determinants and Möbius functions in trace monoids. - Christian Choffrut; Massimiliano Goldwurm (Discret. Math., 1999)

Decision Issues on Functions Realized by Finite Automata. - Christian Choffrut; Hratchia Pélibossian; Pierre Simonnet (J. Autom. Lang. Comb., 1999)

The Theory of Rational Relations on Transfinite Strings. - Christian Choffrut; Serge Grigorieff (Words, Languages & Combinatorics, 2000)

Transfinite Equations in Transfinite Strings. - Christian Choffrut; Sándor Horváth (Int. J. Algebra Comput., 2000)

Timed Automata with Periodic Clock Constraints. - Christian Choffrut; Massimiliano Goldwurm (J. Autom. Lang. Comb., 2000)

On Fatou properties of rational languages. - Christian Choffrut; Juhani Karhumäki (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Elementary Theory of Ordinals with Addition and Left Translation by omega. - Christian Choffrut (Developments in Language Theory, 2001)

Periodicity and roots of transfinite strings. - Olivier Carton; Christian Choffrut (RAIRO Theor. Informatics Appl., 2001)

Long words: the theory of concatenation and omega-power. - Stephen L. Bloom; Christian Choffrut (Theor. Comput. Sci., 2001)

The commutation of finite sets: a challenging problem. - Christian Choffrut; Juhani Karhumäki; Nicolas Ollinger (Theor. Comput. Sci., 2002)

Distances between languages and reflexivity of relations. - Christian Choffrut; Giovanni Pighizzini (Theor. Comput. Sci., 2002)

On the number of occurrences of a symbol in words of regular languages. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (Theor. Comput. Sci., 2003)

Minimizing subsequential transducers: a survey. - Christian Choffrut (Theor. Comput. Sci., 2003)

Rational Relations as Rational Series. - Christian Choffrut (Theory Is Forever, 2004)

On the Maximum Coefficients of Rational Formal Series in Commuting Variables. - Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (Developments in Language Theory, 2004)

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (STACS, 2004)

String-matching with OBDDs. - Christian Choffrut; Yael Haddad (Theor. Comput. Sci., 2004)

Some decision problems on integer matrices. - Christian Choffrut; Juhani Karhumäki (RAIRO Theor. Informatics Appl., 2005)

Preface. - Christian Choffrut; Yoshiko Wakabayashi (RAIRO Theor. Informatics Appl., 2005)

Collage of two-dimensional words. - Christian Choffrut; Berke Durak (Theor. Comput. Sci., 2005)

Context-Free Grammars and XML Languages. - Alberto Bertoni; Christian Choffrut; Beatrice Palano (Developments in Language Theory, 2006)

Relations over Words and Logic: A Chronology. - Christian Choffrut (Bull. EATCS, 2006)

Separability of rational relations in A* × Nm by recognizable relations is decidable. - Christian Choffrut; Serge Grigorieff (Inf. Process. Lett., 2006)

Preface. - Paola Campadelli; Christian Choffrut; Massimiliano Goldwurm; Mauro Torelli (RAIRO Theor. Informatics Appl., 2006)

Decision problems among the main subfamilies of rational relations. - Olivier Carton; Christian Choffrut; Serge Grigorieff (RAIRO Theor. Informatics Appl., 2006)

Local Limit Properties for Pattern Statistics and Rational Models. - Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati (Theory Comput. Syst., 2006)

Definable sets in weak Presburger arithmetic. - Christian Choffrut; Achille Frigeri (ICTCS, 2007)

On the separability of sparse context-free languages and of bounded rational relations. - Christian Choffrut; Flavio D'Alessandro; Stefano Varricchio (Theor. Comput. Sci., 2007)

Literal Shuffle of Compressed Words. - Alberto Bertoni; Christian Choffrut; Roberto Radicioni (IFIP TCS, 2008)

Deciding whether a relation defined in Presburger logic can be defined in weaker logics. - Christian Choffrut (RAIRO Theor. Informatics Appl., 2008)

Preface. - Christian Choffrut; Loïc Colson (RAIRO Theor. Informatics Appl., 2008)

Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2009)

The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2009)

On the Expressive Power of FO[ + ]. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (LATA, 2010)

Deciding whether the ordering is necessary in a Presburger formula. - Christian Choffrut; Achille Frigeri (Discret. Math. Theor. Comput. Sci., 2010)

Contextual partial commutations. - Christian Choffrut; Robert George Mercas (Discret. Math. Theor. Comput. Sci., 2010)

On Bounded Rational Trace Languages. - Christian Choffrut; Flavio D'Alessandro; Stefano Varricchio (Theory Comput. Syst., 2010)

On relations of finite words over infinite alphabets. - Christian Choffrut (AFL, 2011)

The Inclusion Problem of Context-Free Languages: Some Tractable Cases. - Alberto Bertoni; Christian Choffrut; Roberto Radicioni (Int. J. Found. Comput. Sci., 2011)

Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. - Christian Choffrut; Juhani Karhumäki (Theory Comput. Syst., 2011)

First-order logics: some characterizations and closure properties. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Acta Informatica, 2012)

A Note on the Logical Definability of Rational Trace Languages. - Christian Choffrut (Fundam. Informaticae, 2012)

Rational relations having a rational trace on each finite intersection of rational relations. - Christian Choffrut; Serge Grigorieff (Theor. Comput. Sci., 2012)

The Lexicographic Cross-Section of the Plactic Monoid Is Regular. - Christian Choffrut; Robert Mercas (WORDS, 2013)

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Developments in Language Theory, 2013)

An algebraic characterization of unary two-way transducers. - Christian Choffrut; Bruno Guillon (ICTCS, 2014)

Deciding Whether or Not a Synchronous Relation is Regular Prefix. - Christian Choffrut (Fundam. Informaticae, 2014)

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. - Alberto Bertoni; Christian Choffrut; Flavio D'Alessandro (Int. J. Found. Comput. Sci., 2014)

Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations. - Christian Choffrut; Serge Grigorieff (Fields of Logic and Computation II, 2015)

Logical Theory of the Monoid of Languages over a Non Tally Alphabet. - Christian Choffrut; Serge Grigorieff (Fundam. Informaticae, 2015)

Both Ways Rational Functions. - Christian Choffrut; Bruno Guillon (DLT, 2016)

Sequences of words defined by two-way transducers. - Christian Choffrut (Theor. Comput. Sci., 2017)

An Hadamard operation on rational relations. - Christian Choffrut (Theor. Comput. Sci., 2017)

Complexity and (un)decidability of fragments of 〈 ωωλ; × 〉. - Alexis Bès; Christian Choffrut (CoRR, 2018)

Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. - Alexis Bès; Christian Choffrut (CoRR, 2018)

Two equational theories of partial words. - Christian Choffrut; Zoltán Ésik (Theor. Comput. Sci., 2018)

Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉. - Alexis Bès; Christian Choffrut (Fundam. Informaticae, 2019)

Quasi-automatic semigroups. - Benjamin Blanchette; Christian Choffrut; Christophe Reutenauer (Theor. Comput. Sci., 2019)

$ langle mathbb {R}, +, <, 1 rangle $ Is Decidable in $ langle mathbb {R}, +, < , mathbb {Z} rangle $. - Alexis Bès; Christian Choffrut (LATA, 2020)

Theories of real addition with and without a predicate for integers. - Alexis Bès; Christian Choffrut (Log. Methods Comput. Sci., 2021)

Decidability of Definability Issues in the Theory of Real Addition. - Alexis Bès; Christian Choffrut (Fundam. Informaticae, 2022)

Synchronous orders on the set of integers. - Christian Choffrut (CoRR, 2023)

Message complexity for unary multiautomata systems. - Christian Choffrut (CoRR, 2024)

Unary counting quantifiers do not increase the expressive power of Presburger aritmetic: an alternative shorter proof. - Christian Choffrut (CoRR, 2024)

Giovanni in Paris. - Christian Choffrut (Int. J. Found. Comput. Sci., 2025)