| Combinatorics of words C Choffrut, J Karhumäki Handbook of formal languages, 329-438, 1997 | 464 | 1997 |
| Combinatorics of words C Choffrut, J Karhumäki Handbook of formal languages 1, 329-438, 1997 | 449* | 1997 |
| On real-time cellular automata and trellis automata C Choffrut, K Culik Acta Informatica 21 (4), 393-407, 1984 | 191 | 1984 |
| Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles C Choffrut Theoretical Computer Science 5 (3), 325-337, 1977 | 169 | 1977 |
| Minimizing subsequential transducers: a survey C Choffrut Theoretical Computer Science 292 (1), 131-143, 2003 | 92 | 2003 |
| Timed automata with periodic clock constraints C Choffrut, M Goldwurm Journal of Automata, Languages and Combinatorics 5 (4), 371-404, 2000 | 70 | 2000 |
| Some decision problems on integer matrices C Choffrut, J Karhumäki RAIRO-Theoretical Informatics and Applications 39 (1), 125-131, 2005 | 61 | 2005 |
| The commutation of finite sets: a challenging problem C Choffrut, J Karhumäki, N Ollinger Theoretical computer science 273 (1-2), 69-79, 2002 | 54 | 2002 |
| The commutation of finite sets: a challenging problem C Choffrut, J Karhumäki, N Ollinger Theoretical Computer Science 273 (1), 69-79, 2002 | 53 | 2002 |
| A generalization of Ginsburg and Rose's characterization of gsm mappings C Choffrut Automata, Languages and Programming, 88-103, 1979 | 49 | 1979 |
| Properties of finite and pushdown transducers C Choffrut, K Culik II SIAM Journal on Computing 12 (2), 300-315, 1983 | 43 | 1983 |
| Conjugacy in free inverse monoids C Choffrut International Journal of Algebra and Computation 3 (02), 169-188, 1993 | 37 | 1993 |
| Folding of the plane and the design of systolic arrays C Choffrut, K Culik Information Processing Letters 17 (3), 149-153, 1983 | 36 | 1983 |
| On the number of occurrences of a symbol in words of regular languages A Bertoni, C Choffrut, M Goldwurm, V Lonati Theoretical Computer Science 302 (1-3), 431-456, 2003 | 34 | 2003 |
| Distances between languages and reflexivity of relations C Choffrut, G Pighizzini Theoretical Computer Science 286 (1), 117-138, 2002 | 34 | 2002 |
| Uniformization of rational relations C Choffrut, S Grigorieff Jewels are Forever, Contributions on Theoretical Computer Science in Honor …, 1999 | 33 | 1999 |
| Long words: the theory of concatenation and ω-power SL Bloom, C Choffrut Theoretical Computer Science 259 (1-2), 533-548, 2001 | 32 | 2001 |
| Decision problems among the main subfamilies of rational relations O Carton, C Choffrut, S Grigorieff RAIRO-Theoretical Informatics and Applications 40 (2), 255-275, 2006 | 31 | 2006 |
| On extendibility of unavoidable sets C Choffrut, K Culik Discrete Applied Mathematics 9 (2), 125-137, 1984 | 29 | 1984 |
| Décomposition de fonctions rationnelles C Choffrut, MP Schutzenberger Annual Symposium on Theoretical Aspects of Computer Science, 213-226, 1986 | 24 | 1986 |
