![]() | ![]() |
| 2011 | ||
|---|---|---|
| 83 | Christian Choffrut: On relations of finite words over infinite alphabets. AFL 2011: 25-27 | |
| 82 | 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) | |
| 81 | 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) | |
| 2010 | ||
| 80 | Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: On the Expressive Power of FO[ + ]. LATA 2010: 190-201 | |
| 79 | Christian Choffrut, Achille Frigeri: Deciding whether the ordering is necessary in a Presburger formula. Discrete Mathematics & Theoretical Computer Science 12(1): 21-38 (2010) | |
| 78 | Christian Choffrut, Robert George Mercas: Contextual partial commutations. Discrete Mathematics & Theoretical Computer Science 12(4): 59-72 (2010) | |
| 77 | Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio: On Bounded Rational Trace Languages. Theory Comput. Syst. 46(2): 351-369 (2010) | |
| 2009 | ||
| 76 | Christian Choffrut, Juhani Karhumäki: Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. CSR 2009: 71-79 | |
| 75 | Alberto Bertoni, Christian Choffrut, Roberto Radicioni: The Inclusion Problem of Context-Free Languages: Some Tractable Cases. Developments in Language Theory 2009: 103-112 | |
| 74 | 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) | |
| 73 | 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) | |
| 2008 | ||
| 72 | Alberto Bertoni, Christian Choffrut, Roberto Radicioni: Literal Shuffle of Compressed Words. IFIP TCS 2008: 87-100 | |
| 71 | Christian Choffrut, Loïc Colson: Preface. ITA 42(1): 1-4 (2008) | |
| 70 | Christian Choffrut: Deciding whether a relation defined in Presburger logic can be defined in weaker logics. ITA 42(1): 121-135 (2008) | |
| 2007 | ||
| 69 | Christian Choffrut, Achille Frigeri: Definable sets in weak Presburger arithmetic. ICTCS 2007: 175-186 | |
| 68 | 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) | |
| 2006 | ||
| 67 | Alberto Bertoni, Christian Choffrut, Beatrice Palano: Context-Free Grammars and XML Languages. Developments in Language Theory 2006: 108-119 | |
| 66 | Christian Choffrut: Relations over Words and Logic: A Chronology. Bulletin of the EATCS 89: 159-163 (2006) | |
| 65 | Olivier Carton, Christian Choffrut, Serge Grigorieff: Decision problems among the main subfamilies of rational relations. ITA 40(2): 255-275 (2006) | |
| 64 | Paola Campadelli, Christian Choffrut, Massimiliano Goldwurm, Mauro Torelli: Preface. ITA 40(2): (2006) | |
| 63 | Christian Choffrut, Serge Grigorieff: Separability of rational relations in A* × Nm by recognizable relations is decidable. Inf. Process. Lett. 99(1): 27-32 (2006) | |
| 62 | 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) | |
| 2005 | ||
| 61 | Christian Choffrut, Yoshiko Wakabayashi: Preface. ITA 39(1): (2005) | |
| 60 | Christian Choffrut, Juhani Karhumäki: Some decision problems on integer matrices. ITA 39(1): 125-131 (2005) | |
| 59 | Christian Choffrut, Berke Durak: Collage of two-dimensional words. Theor. Comput. Sci. 340(1): 364-380 (2005) | |
| 2004 | ||
| 58 | Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati: On the Maximum Coefficients of Rational Formal Series in Commuting Variables. Developments in Language Theory 2004: 114-126 | |
| 57 | Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati: Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS 2004: 117-128 | |
| 56 | Christian Choffrut: Rational Relations as Rational Series. Theory Is Forever 2004: 29-34 | |
| 55 | Christian Choffrut, Y. Haddad: String-matching with OBDDs. Theor. Comput. Sci. 320(2-3): 187-198 (2004) | |
| 2003 | ||
| 54 | Christian Choffrut: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292(1): 131-143 (2003) | |
| 53 | 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 | ||
| 52 | Christian Choffrut, Juhani Karhumäki, Nicolas Ollinger: The commutation of finite sets: a challenging problem. Theor. Comput. Sci. 273(1-2): 69-79 (2002) | |
| 51 | Christian Choffrut, Giovanni Pighizzini: Distances between languages and reflexivity of relations. Theor. Comput. Sci. 286(1): 117-138 (2002) | |
| 2001 | ||
| 50 | Christian Choffrut: Elementary Theory of Ordinals with Addition and Left Translation by omega. Developments in Language Theory 2001: 15-20 | |
| 49 | Christian Choffrut, Juhani Karhumäki: On Fatou properties of rational languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 227-235 | |
| 48 | Olivier Carton, Christian Choffrut: Periodicity and roots of transfinite strings. ITA 35(6): 525-533 (2001) | |
| 47 | Stephen L. Bloom, Christian Choffrut: Long words: the theory of concatenation and omega-power. Theor. Comput. Sci. 259(1-2): 533-548 (2001) | |
| 2000 | ||
| 46 | Christian Choffrut, Serge Grigorieff: The Theory of Rational Relations on Transfinite Strings. Words, Languages & Combinatorics 2000: 103-133 | |
| 45 | Christian Choffrut, Sándor Horváth: Transfinite Equations in Transfinite Strings. IJAC 10(5): 625-650 (2000) | |
| 44 | Christian Choffrut, Massimiliano Goldwurm: Timed Automata with Periodic Clock Constraints. Journal of Automata, Languages and Combinatorics 5(4): 371-404 (2000) | |
| 1999 | ||
| 43 | Christian Choffrut, Serge Grigorieff: Uniformization of Rational Relations. Jewels are Forever 1999: 59-71 | |
| 42 | Christian Choffrut, Massimiliano Goldwurm: Determinants and Möbius functions in trace monoids. Discrete Mathematics 194(1-3): 239-247 (1999) | |
| 41 | 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) | |
| 1998 | ||
| 40 | Christian Choffrut, Sándor Horváth: Equations in Transfinite Strings. MFCS 1998: 656-664 | |
| 39 | Christian Choffrut, Flavio D'Alessandro: Commutativity in Free Inverse Monoids. Theor. Comput. Sci. 204(1-2): 35-54 (1998) | |
| 1997 | ||
| 38 | Christian Choffrut, Leucio Guerra: Generalized Rational Relations and their Logical Definability. FCT 1997: 138-149 | |
| 37 | Christian Choffrut, Giovanni Pighizzini: Distances Between Languages and Reflexivity of Relations. MFCS 1997: 199-208 | |
| 36 | Christophe Prieur, Christian Choffrut, Michel Latteux: Constructing Sequential Bijections. Structures in Logic and Computer Science 1997: 308-321 | |
| 35 | 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) | |
| 1995 | ||
| 34 | Christian Choffrut, Leucio Guerra: Logical Definability of Some Rational Trace Languages. Mathematical Systems Theory 28(5): 397-420 (1995) | |
| 33 | Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. Mathematical Systems Theory 28(5): 437-450 (1995) | |
| 1994 | ||
| 32 | Ricardo A. Baeza-Yates, Christian Choffrut, Gaston H. Gonnet: On Boyer-Moore Automata. Algorithmica 12(4/5): 268-292 (1994) | |
| 31 | Christian Choffrut: Bijective Sequential Mappings of a Free Monoid Onto Another. ITA 28(3-4): 265-276 (1994) | |
| 1993 | ||
| 30 | Christian Choffrut, Leucio Guerra: On the Logical Definability of Some Rational Trace Languages. STACS 1993: 494-504 | |
| 29 | Christian Choffrut: On the Starheight of Some Rational Subsets Closed under Partial Commutations Inf. Comput. 106(1): 61-82 (1993) | |
| 1992 | ||
| 28 | Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. MFCS 1992: 181-190 | |
| 27 | Christian Choffrut: Rational Relations and Ratonal Series. Theor. Comput. Sci. 98(1): 5-13 (1992) | |
| 1991 | ||
| 26 | Christian Choffrut, Matthias Jantzen: STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, Proceedings Springer 1991 | |
| 25 | Christian Choffrut: Conjugacy in Free Inverse Monoids. IWWERT 1991: 6-22 | |
| 24 | Christian Choffrut: Conjugacies. Bulletin of the EATCS 45: 148-157 (1991) | |
| 1990 | ||
| 23 | Christian Choffrut, Thomas Lengauer: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings Springer 1990 | |
| 22 | Christian Choffrut: Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case. ICALP 1990: 490-500 | |
| 21 | Christian Choffrut: An Optimal Algorithm for building the Boyer-Moore automaton. Bulletin of the EATCS 40: 217-224 (1990) | |
| 1988 | ||
| 20 | Christian Choffrut: Automata Networks, LITP Spring School on Theoretical Computer Science, Angelès-Village, France, May 12-16, 1986, Proceedings Springer 1988 | |
| 19 | Christian Choffrut, Marcel Paul Schützenberger: Counting with Rational Functions. Theor. Comput. Sci. 58: 81-101 (1988) | |
| 1987 | ||
| 18 | Christian Choffrut, Christine Duboc: A Star-Height Problem in Free Monoids with Partial Communications. ICALP 1987: 190-201 | |
| 1986 | ||
| 17 | Christian Choffrut: An Introduction to Automata Network Theory. Automata Networks 1986: 1-18 | |
| 16 | Christian Choffrut, Marcel Paul Schützenberger: Counting with Rational Functions. ICALP 1986: 79-88 | |
| 15 | Christian Choffrut, Marcel Paul Schützenberger: Décomposition de Fonctions Rationnelles. STACS 1986: 213-226 | |
| 1984 | ||
| 14 | Christian Choffrut, Karel Culik II: On Extendibility of Unavoidable Sets. STACS 1984: 326-338 | |
| 13 | Christian Choffrut, Karel Culik II: On Real-Time Cellular Automata and Trellis Automata. Acta Inf. 21: 393-407 (1984) | |
| 1983 | ||
| 12 | Christian Choffrut, Juhani Karhumäki: Test Sets for Morphisms with Bounded Delay. ICALP 1983: 118-127 | |
| 11 | Christian Choffrut, Karel Culik II: Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17(3): 149-153 (1983) | |
| 10 | Christian Choffrut, Karel Culik II: Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12(2): 300-315 (1983) | |
| 1981 | ||
| 9 | Christian Choffrut: Prefix-Preservation fo Rational Partial Functions Is Decidable. Theoretical Computer Science 1981: 159-166 | |
| 8 | Christian Choffrut: A Closure Property of Deterministic Context-Free Languages. Inf. Process. Lett. 12(1): 13-16 (1981) | |
| 1979 | ||
| 7 | Christian Choffrut: A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings. ICALP 1979: 88-103 | |
| 1978 | ||
| 6 | Christian Choffrut: Sur les traductions reconnaissables. ITA 12(3): (1978) | |
| 1977 | ||
| 5 | Christian Choffrut: Applications séquentielles permutables. Elektronische Informationsverarbeitung und Kybernetik 13(7/8): 351-357 (1977) | |
| 4 | Christian Choffrut: Sur Certaines Applications Séquentielles Numériques Information and Control 33(4): 352-363 (1977) | |
| 3 | 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 | ||
| 2 | Christian Choffrut: Strongly Connected G-S-M Mappings Preserving Conjugation. MFCS 1976: 224-229 | |
| 1972 | ||
| 1 | Christian Choffrut: Transducteurs conservant l'imprimitivité du langage d'entrée. ICALP 1972: 13-29 | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page