Christian Choffrut

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

16h-index1.4kcitations134works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(103), Advanced Algebra and Logic(43), Computability, Logic, AI Algorithms(32), Logic, programming, and type systems(26), Algorithms and Data Compression(26)

Publications134 total

Equational theory of ordinals with addition and left multiplication by $ω$
Fundamenta Informaticae·2025Open Access
Giovanni in Paris
International Journal of Foundations of Computer Science·2025
Synchronous orders on the set of integers
arXiv (Cornell University)·2023Open Access
Decidability of Definability Issues in the Theory of Real Addition
Fundamenta Informaticae·2022
Grammic monoids with three generators
Semigroup Forum·2022· 1 cited
Grammic monoids with three generators
arXiv (Cornell University)·2022Open Access
Theories of real addition with and without a predicate for integers
Logical Methods in Computer Science·2021· 5 citedOpen Access
Theories of real addition with and without a predicate for integers
SPIRE - Sciences Po Institutional REpository·2021· 3 citedOpen Access
A characterization of definability in the theory of real addition
arXiv (Cornell University)·2021Open Access
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by $$\omega $$
Algebra Universalis·2020
$$\langle \mathbb {R}, +,<,1 \rangle $$ Is Decidable in $$\langle \mathbb {R}, +,< ,\mathbb {Z}\rangle $$
Lecture notes in computer science·2020· 1 citedOpen Access
Complexity and (Un)decidability of Fragments of 〈ωωλ;×〉
Fundamenta Informaticae·2019
Quasi-automatic semigroups
Theoretical Computer Science·2019· 1 citedOpen Access
Decidability of the existential fragment of some infinitely generated\n trace monoids: an application to ordinals
arXiv (Cornell University)·2018Open Access
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals
arXiv (Cornell University)·2018Open Access
Complexity and (un)decidability of fragments of $\langle \omega^{\omega^\lambda}; \times \rangle$
arXiv (Cornell University)·2018Open Access
Complexity and (un)decidability of fragments of $\langle ω^{ω^λ}; \times \rangle$
arXiv (Cornell University)·2018Open Access
Sequences of words defined by two-way transducers
Theoretical Computer Science·2016· 1 cited
Both Ways Rational Functions
Lecture notes in computer science·2016
An Hadamard operation on rational relations
Theoretical Computer Science·2015
page 1 of 7Next →

Frequent Co-authors

Alberto Bertoni(7), Massimiliano Goldwurm(6), Juhani Karhumäki(5), Karel Čulík(4), Violetta Lonati(3), Serge Grigorieff(3), Roberto Radicioni(3), Flavio D’Alessandro(3), M. P. Schützenberger(2), Achille Frigeri(2), Juhani Karhumäki(1), Nicolas Ollinger(1), Stephen L. Bloom(1), Giovanni Pighizzini(1), Ricardo Baeza‐Yates(1), Gastón H. Gonnet(1), Andreas Malcher(1), Carlo Mereghetti(1), Beatrice Palano(1), Tero Harju(1)