C. Choffrut

发表

Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by $$\omega $$ ω

C. Choffrut, S. Grigorieff, 2020 .

The “ equal last ” predicate for words on infinite alphabets and classes of multitape automata

C. Choffrut, 2008 .

Minimizing subsequential transducers : a surveyChristian Choffrut

C. Choffrut, 2009 .

Weakening Presburger Arithmetic

C. Choffrut, 2007 .

A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid

C. Choffrut, S. Holub, 2016 .

Selected papers of the 8th annual symposium on Theoretical aspects of computer science

C. Choffrut, M. Jantzen, 1993 .

An Optimal Algorithm for building the Boyer-Moore automaton

Christian Choffrut, C. Choffrut, 1990, Bull. EATCS.

Relations over Words and Logic: A Chronology

Christian Choffrut, C. Choffrut, 2006, Bull. EATCS.

An Introduction to Automata Network Theory

Christian Choffrut, C. Choffrut, 1986, Automata Networks.

On relations of finite words over infinite alphabets

Christian Choffrut, C. Choffrut, 2011, AFL.

A SHORT INTRODUCTION TO AUTOMATIC GROUP THEORY

Christian Choffrut, C. Choffrut, 2002 .

Complexity and (un)decidability of fragments of $\langle \omega^{\omega^\lambda}; \times \rangle$

C. Choffrut, A. Bès, 2018 .

Decidability of definability issues in the theory of real addition

C. Choffrut, A. Bès, 2021, 2102.06160.

A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid

C. Choffrut, S. Holub, 2015, Semigroup Forum.

Grammic monoids with three generators

C. Choffrut, 2022, Semigroup Forum.

Decidability of Definability Issues in the Theory of Real Addition

C. Choffrut, A. Bès, 2021, Fundam. Informaticae.

Minimizing subsequential transducers: a survey

Christian Choffrut, C. Choffrut, 2003, Theor. Comput. Sci..

Matrix Representations of Trace Monoids

C. Choffrut, 2007 .

Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science

Thomas Lengauer, Christian Choffrut, Thomas Lengauer, 1990 .

Some decision problems on integer matrices

Christian Choffrut, Juhani Karhumäki, J. Karhumäki, 2005, RAIRO Theor. Informatics Appl..

First-order logics: some characterizations and closure properties

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2012, Acta Informatica.

On the Expressive Power of FO[ + ]

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2010, LATA.

Folding of the Plane and the Design of Systolic Arrays

Christian Choffrut, Karel Culik, K. Culík, 1983, Inf. Process. Lett..

A remark on the representation of trace monoids

C. Choffrut, C. Choffrut, 1990 .

Logical definability of some rational trace languages

Christian Choffrut, Leucio Guerra, C. Choffrut, 1995, Mathematical systems theory.

The commutation of finite sets: a challenging problem

Nicolas Ollinger, Christian Choffrut, Juhani Karhumäki, 1999, Theor. Comput. Sci..

Commutativity in Free Inverse Monoids

Christian Choffrut, Flavio D'Alessandro, Flavio D'Alessandro, 1998, Theor. Comput. Sci..

Combinatorics of Words

Christian Choffrut, Juhani Karhumäki, J. Karhumäki, 1997, Handbook of Formal Languages.

Conjugacy in Free Inverse Monoids

Christian Choffrut, C. Choffrut, 1991, Int. J. Algebra Comput..

Long words: the theory of concatenation and omega-power

Christian Choffrut, Stephen L. Bloom, S. Bloom, 2001, Theor. Comput. Sci..

Contextual partial commutations

Christian Choffrut, Robert Mercas, C. Choffrut, 2010, Discret. Math. Theor. Comput. Sci..

Deciding Whether or Not a Synchronous Relation is Regular Prefix

Christian Choffrut, C. Choffrut, 2014, Fundam. Informaticae.

Decision problems among the main subfamilies of rational relations

Olivier Carton, Christian Choffrut, Serge Grigorieff, 2006, RAIRO Theor. Informatics Appl..

Uniformization of Rational Relations

Christian Choffrut, Serge Grigorieff, C. Choffrut, 1999, Jewels are Forever.

A Star-Height Problem in Free Monoids with Partial Communications

Christian Choffrut, Christine Duboc, C. Choffrut, 1987, ICALP.

Test sets for morphisms with bounded delay

Christian Choffrut, Juhani Karhumäki, J. Karhumäki, 1983, Discret. Appl. Math..

Theoretical Informatics and Applications Deciding Whether a Relation Defined in Presburger Logic Can Be Defined in Weaker Logics

Christian Choffrut, C. Choffrut, 2022 .

Generalized Rational Relations and their Logical Definability

Christian Choffrut, Leucio Guerra, C. Choffrut, 1997, FCT.

Theories of real addition with and without a predicate for integers

C. Choffrut, A. Bès, 2020, Log. Methods Comput. Sci..

\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\langle \mathbb {R}, +,<,1 \rangle $$\end{document} Is Decidable in \d

C. Choffrut, A. Bès, 2020, LATA.

Local Limit Properties for Pattern Statistics and Rational Models

Alberto Bertoni, Christian Choffrut, Violetta Lonati, 2006, Theory of Computing Systems.

On the number of occurrences of a symbol in words of regular languages

Alberto Bertoni, Christian Choffrut, Violetta Lonati, 2003, Theor. Comput. Sci..

Rational transductions and complexity of counting problems

Christian Choffrut, Massimiliano Goldwurm, C. Choffrut, 1992, Mathematical systems theory.

On Fatou properties of rational languages

Christian Choffrut, Juhani Karhumäki, J. Karhumäki, 1999, Where Mathematics, Computer Science, Linguistics and Biology Meet.

A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings

Christian Choffrut, C. Choffrut, 1979, ICALP.

On extendibility of unavoidable sets

Christian Choffrut, Karel Culik, K. Culík, 1984, Discret. Appl. Math..

Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models

Alberto Bertoni, Christian Choffrut, Violetta Lonati, 2004, STACS.

On Bounded Rational Trace Languages

Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio, 2010, Theory of Computing Systems.

Determinants and Möbius functions in trace monoids

Christian Choffrut, Massimiliano Goldwurm, C. Choffrut, 1999, Discret. Math..

Properties of Finite and Pushdown Transducers

Christian Choffrut, Karel Culik, K. Culík, 1983, SIAM J. Comput..