Christian Choffrut

Publication Activity (10 Years)

Years Active: 1972-2023
Publications (10 Years): 14

Top Venues

CoRR

Fundam. Informaticae

Theor. Comput. Sci.

ICTCS

Publications

Christian Choffrut
Synchronous orders on the set of integers. CoRR (2023)
Alexis Bès, Christian Choffrut
Decidability of Definability Issues in the Theory of Real Addition. Fundam. Informaticae 188 (1) (2022)
Alexis Bès, Christian Choffrut
Theories of real addition with and without a predicate for integers. Log. Methods Comput. Sci. 17 (2) (2021)
Alexis Bès, Christian Choffrut
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. LATA (2020)
Alexis Bès, Christian Choffrut
Theories of real addition with and without a predicate for integers. CoRR (2020)
Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer
Quasi-automatic semigroups. Theor. Comput. Sci. 777 (2019)
Benjamin Blanchette, Christian Choffrut, Christophe Reutenauer
Quasi-automatic semigroups. CoRR (2019)
Alexis Bès, Christian Choffrut
Complexity and (Un)decidability of Fragments of 〈 ω ω λ ;× 〉. Fundam. Informaticae 164 (1) (2019)
Alexis Bès, Christian Choffrut
Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals. CoRR (2018)
Christian Choffrut, Zoltán Ésik
Two equational theories of partial words. Theor. Comput. Sci. 737 (2018)
Alexis Bès, Christian Choffrut
; × 〉. CoRR (2018)
Christian Choffrut
Sequences of words defined by two-way transducers. Theor. Comput. Sci. 658 (2017)
Christian Choffrut
An Hadamard operation on rational relations. Theor. Comput. Sci. 664 (2017)
Christian Choffrut, Bruno Guillon
Both Ways Rational Functions. DLT (2016)
Christian Choffrut, Serge Grigorieff
Logical Theory of the Monoid of Languages over a Non Tally Alphabet. Fundam. Informaticae 138 (1-2) (2015)
Christian Choffrut, Serge Grigorieff
Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations. Fields of Logic and Computation II (2015)
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages. Int. J. Found. Comput. Sci. 25 (8) (2014)
Christian Choffrut
Deciding Whether or Not a Synchronous Relation is Regular Prefix. Fundam. Informaticae 132 (4) (2014)
Christian Choffrut, Bruno Guillon
An Algebraic Characterization of Unary Two-Way Transducers. MFCS (1) (2014)
Christian Choffrut, Bruno Guillon
An algebraic characterization of unary two-way transducers. ICTCS (2014)
Christian Choffrut, Robert Mercas
The Lexicographic Cross-Section of the Plactic Monoid Is Regular. WORDS (2013)
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. Developments in Language Theory (2013)
Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro
Quantum finite automata and linear context-free languages: a decidable problem CoRR (2013)
Christian Choffrut, Serge Grigorieff
Rational relations having a rational trace on each finite intersection of rational relations. Theor. Comput. Sci. 454 (2012)
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
First-order logics: some characterizations and closure properties. Acta Informatica 49 (4) (2012)
Christian Choffrut
A Note on the Logical Definability of Rational Trace Languages. Fundam. Informaticae 116 (1-4) (2012)
Alberto Bertoni, Christian Choffrut, Roberto Radicioni
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Int. J. Found. Comput. Sci. 22 (2) (2011)
Christian Choffrut
On relations of finite words over infinite alphabets. AFL (2011)
Christian Choffrut, Juhani Karhumäki
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. Theory Comput. Syst. 49 (2) (2011)
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
On the Expressive Power of FO[ + ]. LATA (2010)
Christian Choffrut, Achille Frigeri
Deciding whether the ordering is necessary in a Presburger formula. Discret. Math. Theor. Comput. Sci. 12 (1) (2010)
Christian Choffrut, Robert George Mercas
Contextual partial commutations. Discret. Math. Theor. Comput. Sci. 12 (4) (2010)
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
On Bounded Rational Trace Languages. Theory Comput. Syst. 46 (2) (2010)
Alberto Bertoni, Christian Choffrut, Roberto Radicioni
The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Developments in Language Theory (2009)
Christian Choffrut, Serge Grigorieff
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. Theor. Comput. Sci. 410 (1) (2009)
Christian Choffrut, Juhani Karhumäki
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR (2009)
Christian Choffrut, Serge Grigorieff
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata. Theor. Comput. Sci. 410 (30-32) (2009)
Christian Choffrut, Loïc Colson
Preface. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Christian Choffrut
Deciding whether a relation defined in Presburger logic can be defined in weaker logics. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Alberto Bertoni, Christian Choffrut, Roberto Radicioni
Literal Shuffle of Compressed Words. IFIP TCS (2008)
Christian Choffrut, Achille Frigeri
Definable sets in weak Presburger arithmetic. ICTCS (2007)
Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
On the separability of sparse context-free languages and of bounded rational relations. Theor. Comput. Sci. 381 (1-3) (2007)
Olivier Carton, Christian Choffrut, Serge Grigorieff
Decision problems among the main subfamilies of rational relations. RAIRO Theor. Informatics Appl. 40 (2) (2006)
Alberto Bertoni, Christian Choffrut, Beatrice Palano
Context-Free Grammars and XML Languages. Developments in Language Theory (2006)
Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
Local Limit Properties for Pattern Statistics and Rational Models. Theory Comput. Syst. 39 (1) (2006)
Christian Choffrut
Relations over Words and Logic: A Chronology. Bull. EATCS 89 (2006)
Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli
Preface. RAIRO Theor. Informatics Appl. 40 (2) (2006)
Christian Choffrut, Serge Grigorieff
by recognizable relations is decidable. Inf. Process. Lett. 99 (1) (2006)
Christian Choffrut, Juhani Karhumäki
Some decision problems on integer matrices. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Christian Choffrut, Yoshiko Wakabayashi
Preface. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Christian Choffrut, Berke Durak
Collage of two-dimensional words. Theor. Comput. Sci. 340 (1) (2005)
Christian Choffrut
Rational Relations as Rational Series. Theory Is Forever (2004)
Christian Choffrut, Yael Haddad
String-matching with OBDDs. Theor. Comput. Sci. 320 (2-3) (2004)
Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
On the Maximum Coefficients of Rational Formal Series in Commuting Variables. Developments in Language Theory (2004)
Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS (2004)
Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati
On the number of occurrences of a symbol in words of regular languages. Theor. Comput. Sci. 302 (1-3) (2003)
Christian Choffrut
Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292 (1) (2003)
Christian Choffrut, Giovanni Pighizzini
Distances between languages and reflexivity of relations. Theor. Comput. Sci. 286 (1) (2002)
Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger
The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273 (1-2) (2002)
Stephen L. Bloom, Christian Choffrut
Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259 (1-2) (2001)
Christian Choffrut, Juhani Karhumäki
On Fatou properties of rational languages. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Christian Choffrut
Elementary Theory of Ordinals with Addition and Left Translation by omega. Developments in Language Theory (2001)
Olivier Carton, Christian Choffrut
Periodicity and roots of transfinite strings. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Christian Choffrut, Sándor Horváth
Transfinite Equations in Transfinite Strings. Int. J. Algebra Comput. 10 (5) (2000)
Christian Choffrut, Serge Grigorieff
The Theory of Rational Relations on Transfinite Strings. Words, Languages & Combinatorics (2000)
Christian Choffrut, Massimiliano Goldwurm
Timed Automata with Periodic Clock Constraints. J. Autom. Lang. Comb. 5 (4) (2000)
Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet
Decision Issues on Functions Realized by Finite Automata. J. Autom. Lang. Comb. 4 (3) (1999)
Christian Choffrut, Massimiliano Goldwurm
Determinants and Möbius functions in trace monoids. Discret. Math. 194 (1-3) (1999)
Christian Choffrut, Serge Grigorieff
Uniformization of Rational Relations. Jewels are Forever (1999)
Christian Choffrut, Flavio D'Alessandro
Commutativity in Free Inverse Monoids. Theor. Comput. Sci. 204 (1-2) (1998)
Christian Choffrut, Sándor Horváth
Equations in Transfinite Strings. MFCS (1998)
Christian Choffrut, Giovanni Pighizzini
Distances Between Languages and Reflexivity of Relations. MFCS (1997)
Christian Choffrut, Leucio Guerra
Generalized Rational Relations and their Logical Definability. FCT (1997)
Christophe Prieur, Christian Choffrut, Michel Latteux
Constructing Sequential Bijections. Structures in Logic and Computer Science (1997)
Christian Choffrut, Tero Harju, Juhani Karhumäki
A Note on Decidability Questions on Presentations of Word Semigroups. Theor. Comput. Sci. 183 (1) (1997)
Christian Choffrut, Massimiliano Goldwurm
Rational Transductions and Complexity of Counting Problems. Math. Syst. Theory 28 (5) (1995)
Christian Choffrut, Leucio Guerra
Logical Definability of Some Rational Trace Languages. Math. Syst. Theory 28 (5) (1995)
Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet
On Boyer-Moore Automata. Algorithmica 12 (4/5) (1994)
Christian Choffrut
Bijective Sequential Mappings of a Free Monoid Onto Another. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Christian Choffrut
On the Starheight of Some Rational Subsets Closed under Partial Commutations Inf. Comput. 106 (1) (1993)
Christian Choffrut, Leucio Guerra
On the Logical Definability of Some Rational Trace Languages. STACS (1993)
Christian Choffrut
Conjugacy in Free Inverse Monoids. Int. J. Algebra Comput. 3 (2) (1993)
Christian Choffrut, Massimiliano Goldwurm
Rational Transductions and Complexity of Counting Problems. MFCS (1992)
Christian Choffrut
Rational Relations and Ratonal Series. Theor. Comput. Sci. 98 (1) (1992)
Christian Choffrut
Conjugacy in Free Inverse Monoids. IWWERT (1991)
Christian Choffrut
Conjugacies. Bull. EATCS 45 (1991)
Christian Choffrut
An Optimal Algorithm for building the Boyer-Moore automaton. Bull. EATCS 40 (1990)
Christian Choffrut
Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. ICALP (1990)
Christian Choffrut, Marcel Paul Schützenberger
Counting with Rational Functions. Theor. Comput. Sci. 58 (1988)
Christian Choffrut, Christine Duboc
A Star-Height Problem in Free Monoids with Partial Communications. ICALP (1987)
Christian Choffrut, Marcel Paul Schützenberger
Counting with Rational Functions. ICALP (1986)
Christian Choffrut, Marcel Paul Schützenberger
Décomposition de Fonctions Rationnelles. STACS (1986)
Christian Choffrut
An Introduction to Automata Network Theory. Automata Networks (1986)
Christian Choffrut, Juhani Karhumäki
Test sets for morphisms with bounded delay. Discret. Appl. Math. 12 (2) (1985)
Christian Choffrut, Karel Culík II
On Real-Time Cellular Automata and Trellis Automata. Acta Informatica 21 (1984)
Christian Choffrut, Karel Culík II
On extendibility of unavoidable sets. Discret. Appl. Math. 9 (2) (1984)
Christian Choffrut, Karel Culík II
On Extendibility of Unavoidable Sets. STACS (1984)
Christian Choffrut, Karel Culík II
Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12 (2) (1983)
Christian Choffrut, Karel Culík II
Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17 (3) (1983)
Christian Choffrut, Juhani Karhumäki
Test Sets for Morphisms with Bounded Delay. ICALP (1983)

Christian Choffrut.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christian Choffrut