Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christian Choffrut
2010 – today
- 2013
[c33]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro: Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem. Developments in Language Theory 2013: 82-93- [i1]Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro: Quantum finite automata and linear context-free languages: a decidable problem. CoRR abs/1303.2967 (2013)
- 2012
- [j51]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: First-order logics: some characterizations and closure properties. Acta Inf. 49(4): 225-248 (2012)
- [j50]Christian Choffrut: A Note on the Logical Definability of Rational Trace Languages. Fundam. Inform. 116(1-4): 45-50 (2012)
- [j49]Christian Choffrut, Serge Grigorieff: Rational relations having a rational trace on each finite intersection of rational relations. Theor. Comput. Sci. 454: 88-94 (2012)
- 2011
- [j48]Alberto Bertoni, Christian Choffrut, Roberto Radicioni: The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Int. J. Found. Comput. Sci. 22(2): 289-299 (2011)
- [j47]Christian Choffrut, Juhani Karhumäki: Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. Theory Comput. Syst. 49(2): 355-364 (2011)
- [c32]
- 2010
- [j46]Christian Choffrut, Achille Frigeri: Deciding whether the ordering is necessary in a Presburger formula. Discrete Mathematics & Theoretical Computer Science 12(1): 21-38 (2010)
- [j45]Christian Choffrut, Robert George Mercas: Contextual partial commutations. Discrete Mathematics & Theoretical Computer Science 12(4): 59-72 (2010)
- [j44]Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio: On Bounded Rational Trace Languages. Theory Comput. Syst. 46(2): 351-369 (2010)
- [c31]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: On the Expressive Power of FO[ + ]. LATA 2010: 190-201
2000 – 2009
- 2009
- [j43]Christian Choffrut, Serge Grigorieff: Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. Theor. Comput. Sci. 410(1): 16-34 (2009)
- [j42]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): 2870-2884 (2009)
- [c30]Christian Choffrut, Juhani Karhumäki: Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR 2009: 71-79
- [c29]Alberto Bertoni, Christian Choffrut, Roberto Radicioni: The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Developments in Language Theory 2009: 103-112
- 2008
- [j41]
- [j40]Christian Choffrut: Deciding whether a relation defined in Presburger logic can be defined in weaker logics. ITA 42(1): 121-135 (2008)
- [c28]Alberto Bertoni, Christian Choffrut, Roberto Radicioni: Literal Shuffle of Compressed Words. IFIP TCS 2008: 87-100
- 2007
- [j39]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): 274-279 (2007)
- [c27]Christian Choffrut, Achille Frigeri: Definable sets in weak Presburger arithmetic. ICTCS 2007: 175-186
- 2006
- [j38]Christian Choffrut: Relations over Words and Logic: A Chronology. Bulletin of the EATCS 89: 159-163 (2006)
- [j37]Christian Choffrut, Serge Grigorieff: Separability of rational relations in A* × Nm by recognizable relations is decidable. Inf. Process. Lett. 99(1): 27-32 (2006)
- [j36]Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli: Preface. ITA 40(2) (2006)
- [j35]Olivier Carton, Christian Choffrut, Serge Grigorieff: Decision problems among the main subfamilies of rational relations. ITA 40(2): 255-275 (2006)
- [j34]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati: Local Limit Properties for Pattern Statistics and Rational Models. Theory Comput. Syst. 39(1): 209-235 (2006)
- [c26]Alberto Bertoni, Christian Choffrut, Beatrice Palano: Context-Free Grammars and XML Languages. Developments in Language Theory 2006: 108-119
- 2005
- [j33]Christian Choffrut, Juhani Karhumäki: Some decision problems on integer matrices. ITA 39(1): 125-131 (2005)
- [j32]
- [j31]Christian Choffrut, Berke Durak: Collage of two-dimensional words. Theor. Comput. Sci. 340(1): 364-380 (2005)
- 2004
- [j30]Christian Choffrut, Y. Haddad: String-matching with OBDDs. Theor. Comput. Sci. 320(2-3): 187-198 (2004)
- [c25]
- [c24]Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati: On the Maximum Coefficients of Rational Formal Series in Commuting Variables. Developments in Language Theory 2004: 114-126
- [c23]Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati: Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS 2004: 117-128
- 2003
- [j29]Christian Choffrut: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292(1): 131-143 (2003)
- [j28]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): 431-456 (2003)
- 2002
- [j27]Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger: The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273(1-2): 69-79 (2002)
- [j26]Christian Choffrut, Giovanni Pighizzini: Distances between languages and reflexivity of relations. Theor. Comput. Sci. 286(1): 117-138 (2002)
- 2001
- [j25]Olivier Carton, Christian Choffrut: Periodicity and roots of transfinite strings. ITA 35(6): 525-533 (2001)
- [j24]Stephen L. Bloom, Christian Choffrut: Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259(1-2): 533-548 (2001)
- [c22]Christian Choffrut, Juhani Karhumäki: On Fatou properties of rational languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 227-235
- [c21]Christian Choffrut: Elementary Theory of Ordinals with Addition and Left Translation by omega. Developments in Language Theory 2001: 15-20
- 2000
- [j23]Christian Choffrut, Sándor Horváth: Transfinite Equations in Transfinite Strings. IJAC 10(5): 625-650 (2000)
- [j22]Christian Choffrut, Massimiliano Goldwurm: Timed Automata with Periodic Clock Constraints. Journal of Automata, Languages and Combinatorics 5(4): 371-404 (2000)
- [c20]Christian Choffrut, Serge Grigorieff: The Theory of Rational Relations on Transfinite Strings. Words, Languages & Combinatorics 2000: 103-133
1990 – 1999
- 1999
- [j21]Christian Choffrut, Massimiliano Goldwurm: Determinants and Möbius functions in trace monoids. Discrete Mathematics 194(1-3): 239-247 (1999)
- [j20]Christian Choffrut, Hratchia Pélibossian, Pierre Simonnet: Decision Issues on Functions Realized by Finite Automata. Journal of Automata, Languages and Combinatorics 4(3): 171-182 (1999)
- [c19]Christian Choffrut, Serge Grigorieff: Uniformization of Rational Relations. Jewels are Forever 1999: 59-71
- 1998
- [j19]Christian Choffrut, Flavio D'Alessandro: Commutativity in Free Inverse Monoids. Theor. Comput. Sci. 204(1-2): 35-54 (1998)
- [c18]
- 1997
- [j18]Christian Choffrut, Tero Harju, Juhani Karhumäki: A Note on Decidability Questions on Presentations of Word Semigroups. Theor. Comput. Sci. 183(1): 83-92 (1997)
- [c17]Christophe Prieur, Christian Choffrut, Michel Latteux: Constructing Sequential Bijections. Structures in Logic and Computer Science 1997: 308-321
- [c16]Christian Choffrut, Leucio Guerra: Generalized Rational Relations and their Logical Definability. FCT 1997: 138-149
- [c15]Christian Choffrut, Giovanni Pighizzini: Distances Between Languages and Reflexivity of Relations. MFCS 1997: 199-208
- 1995
- [j17]Christian Choffrut, Leucio Guerra: Logical Definability of Some Rational Trace Languages. Mathematical Systems Theory 28(5): 397-420 (1995)
- [j16]Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. Mathematical Systems Theory 28(5): 437-450 (1995)
- 1994
- [j15]Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet: On Boyer-Moore Automata. Algorithmica 12(4/5): 268-292 (1994)
- [j14]Christian Choffrut: Bijective Sequential Mappings of a Free Monoid Onto Another. ITA 28(3-4): 265-276 (1994)
- 1993
- [j13]Christian Choffrut: On the Starheight of Some Rational Subsets Closed under Partial Commutations. Inf. Comput. 106(1): 61-82 (1993)
- [c14]Christian Choffrut, Leucio Guerra: On the Logical Definability of Some Rational Trace Languages. STACS 1993: 494-504
- 1992
- [j12]
- [c13]Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. MFCS 1992: 181-190
- 1991
- [j11]
- [c12]
- [e3]Christian Choffrut, Matthias Jantzen (Eds.): STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings. Lecture Notes in Computer Science 480, Springer 1991, ISBN 3-540-53709-0
- 1990
- [j10]Christian Choffrut: An Optimal Algorithm for building the Boyer-Moore automaton. Bulletin of the EATCS 40: 217-224 (1990)
- [c11]Christian Choffrut: Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. ICALP 1990: 490-500
- [e2]Christian Choffrut, Thomas Lengauer (Eds.): STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings. Lecture Notes in Computer Science 415, Springer 1990, ISBN 3-540-52282-4
1980 – 1989
- 1988
- [j9]Christian Choffrut, Marcel Paul Schützenberger: Counting with Rational Functions. Theor. Comput. Sci. 58: 81-101 (1988)
- [e1]Christian Choffrut (Ed.): Automata Networks, LITP Spring School on Theoretical Computer Science, Angelès-Village, France, May 12-16, 1986, Proceedings. Lecture Notes in Computer Science 316, Springer 1988, ISBN 3-540-19444-4
- 1987
- [c10]Christian Choffrut, Christine Duboc: A Star-Height Problem in Free Monoids with Partial Communications. ICALP 1987: 190-201
- 1986
- [c9]
- [c8]
- [c7]Christian Choffrut, Marcel Paul Schützenberger: Décomposition de Fonctions Rationnelles. STACS 1986: 213-226
- 1984
- [j8]Christian Choffrut, Karel Culik II: On Real-Time Cellular Automata and Trellis Automata. Acta Inf. 21: 393-407 (1984)
- [c6]
- 1983
- [j7]Christian Choffrut, Karel Culik II: Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17(3): 149-153 (1983)
- [j6]Christian Choffrut, Karel Culik II: Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12(2): 300-315 (1983)
- [c5]Christian Choffrut, Juhani Karhumäki: Test Sets for Morphisms with Bounded Delay. ICALP 1983: 118-127
- 1981
- [j5]Christian Choffrut: A Closure Property of Deterministic Context-Free Languages. Inf. Process. Lett. 12(1): 13-16 (1981)
- [c4]Christian Choffrut: Prefix-Preservation fo Rational Partial Functions Is Decidable. Theoretical Computer Science 1981: 159-166
1970 – 1979
- 1979
- [c3]Christian Choffrut: A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. ICALP 1979: 88-103
- 1978
- [j4]
- 1977
- [j3]Christian Choffrut: Applications séquentielles permutables. Elektronische Informationsverarbeitung und Kybernetik 13(7/8): 351-357 (1977)
- [j2]Christian Choffrut: Sur Certaines Applications Séquentielles Numériques. Information and Control 33(4): 352-363 (1977)
- [j1]Christian Choffrut: Une Caracterisation des Fonctions Sequentielles et des Fonctions Sous-Sequentielles en tant que Relations Rationnelles. Theor. Comput. Sci. 5(3): 325-337 (1977)
- 1976
- [c2]
- 1972
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:48 CEST by the dblp team