Jean-Marc Champarnaud

	2012
68		Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot: Approximate Regular Expressions and Their Derivatives. LATA 2012: 179-191
	2011
67		Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel: Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings Springer 2011
66		Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne: Geometrical Regular Languages and Linear Diophantine Equations. DCFS 2011: 107-120
65		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Partial Derivatives of an Extended Regular Expression. LATA 2011: 179-191
64		Jean-Marc Champarnaud, Jacques Farré, Franck Guingne: Reduction Techniques for Acyclic Cover Transducers. Fundam. Inform. 111(4): 357-371 (2011)
63		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Erratum to "Acyclic automata and small expressions using multi-tilde-bar operators" [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]. Theor. Comput. Sci. 412(29): 3795-3796 (2011)
	2010
62		Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Regular Geometrical Languages and Tiling the Plane. CIAA 2010: 69-78
61		Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Geometricity of Binary Regular Languages. LATA 2010: 178-189
60		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Acyclic automata and small expressions using multi-tilde-bar operators. Theor. Comput. Sci. 411(38-39): 3423-3435 (2010)
	2009
59		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Small Extended Expressions for Acyclic Automata. CIAA 2009: 198-207
58		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Multi-tilde Operators and Their Glushkov Automata. LATA 2009: 290-301
57		Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: A New Family of Regular Operators Fitting with the Position Automaton Computation. SOFSEM 2009: 645-655
56		Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: An Efficient Computation of the Equation K-automaton of a Regular K-expression. Fundam. Inform. 90(1-2): 1-16 (2009)
55		Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical. Int. J. Found. Comput. Sci. 20(4): 763-774 (2009)
	2008
54		Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). CIAA 2008: 68-77
53		Jean-Marc Champarnaud, Franck Guingne, André Kempe, Florent Nicart: Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines. Int. J. Found. Comput. Sci. 19(2): 453-476 (2008)
	2007
52		Jean-Marc Champarnaud, Franck Guingne, Jacques Farré: Reducing Acyclic Cover Transducers. CIAA 2007: 38-50
51		Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: An Efficient Computation of the Equation K-Automaton of a Regular K-Expression. Developments in Language Theory 2007: 145-156
50		Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard: Geometrical Languages. LATA 2007: 127-138
49		Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: Normalized Expressions and Finite Automata. IJAC 17(1): 141-154 (2007)
48		Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe: Labelling Multi-Tape Automata with Constrained Symbol Classes. Int. J. Found. Comput. Sci. 18(4): 847-858 (2007)
	2006
47		Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe: Multi-tape Automata with Symbol Classes. CIAA 2006: 126-136
46		Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi: From the ZPC Structure of a Regular Expression to its Follow Automaton. IJAC 16(1): 17-34 (2006)
	2005
45		André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart: A Class of Rational n-WFSM Auto-intersections. CIAA 2005: 188-198
44		André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart: WFSM Auto-intersection and Join Algorithms. FSMNLP 2005: 120-131
43		Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Similarity relations and cover automata. ITA 39(1): 115-123 (2005)
42		Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën: Brute force determinization of nfas by means of state covers. Int. J. Found. Comput. Sci. 16(3): 441-451 (2005)
41		Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16(5): 851-865 (2005)
40		Jean-Marc Champarnaud, Fabien Coulon: Enumerating nondeterministic automata for a given language without constructing the canonical automaton. Int. J. Found. Comput. Sci. 16(6): 1253-1266 (2005)
39		Jean-Marc Champarnaud, Thomas Paranthoën: Random generation of DFAs. Theor. Comput. Sci. 330(2): 221-235 (2005)
38		Jean-Marc Champarnaud, Fabien Coulon: Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. Theor. Comput. Sci. 347(1-2): 437-440 (2005)
	2004
37		Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën: Brute Force Determinization of NFAs by Means of State Covers. CIAA 2004: 80-89
36		Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi: Computing the Follow Automaton of an Expression. CIAA 2004: 90-101
35		Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Reducing Cover Subsequential Transducers. DCFS 2004: 131-144
34		Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: Follow Automaton versus Equation Automaton. DCFS 2004: 145-153
33		Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin: Unavoidable Sets of Constant Length. IJAC 14(2): 241-251 (2004)
32		Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën: Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81(4): 383-401 (2004)
31		Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi: From Regular Weighted Expressions To Finite Automata. Int. J. Found. Comput. Sci. 15(5): 687-700 (2004)
30		Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi: Random Generation Models for NFAs. Journal of Automata, Languages and Combinatorics 9(2/3): 203-216 (2004)
29		Jean-Marc Champarnaud, Gérard Duchamp: Derivatives of rational expressions and related theorems. Theor. Comput. Sci. 313(1): 31-44 (2004)
28		Jean-Marc Champarnaud, Fabien Coulon: NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327(3): 241-253 (2004)
	2003
27		Jean-Marc Champarnaud, Denis Maurel: Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers Springer 2003
26		Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi: From Regular Weighted Expressions to Finite Automata. CIAA 2003: 49-60
25		Jean-Marc Champarnaud, Thomas Paranthoën: Random DFAs over a Non-Unary Alphabet. DCFS 2003: 90-101
24		Jean-Marc Champarnaud, Fabien Coulon: NFA Reduction Algorithms by Means of Regular Inequalities. Developments in Language Theory 2003: 194-205
23		Jean-Marc Champarnaud, Fabien Coulon: Theoretical study and implementation of the canonical automaton. Fundam. Inform. 55(1): 23-38 (2003)
22		Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe: Virtual Operations On Virtual Networks: The Priority Union . Int. J. Found. Comput. Sci. 14(6): 1055-1071 (2003)
	2002
21		Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi: NFAs bitstream-based random generation. DCFS 2002: 81-94
20		Jean-Marc Champarnaud: Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. Int. J. Found. Comput. Sci. 13(1): 99-113 (2002)
19		Jean-Marc Champarnaud, Djelloul Ziadi: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1): 137-163 (2002)
	2001
18		Jean-Marc Champarnaud, Gérard Duchamp: Brzozowski's Derivatives Extended to Multiplicities. CIAA 2001: 52-64
17		Jean-Marc Champarnaud, Djelloul Ziadi: Computing the Equation Automaton of a Regular Expression in Space and Time. CPM 2001: 157-168
16		Jean-Marc Champarnaud, Djelloul Ziadi: From Mirkin's Prebases to Antimirov's Word Partial Derivatives. Fundam. Inform. 45(3): 195-205 (2001)
15		Jean-Marc Champarnaud, Djelloul Ziadi: From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. IJAC 11(6): 707-736 (2001)
14		Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi: Foreword. Theor. Comput. Sci. 267(1-2): 1 (2001)
13		Jean-Marc Champarnaud: Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theor. Comput. Sci. 267(1-2): 17-34 (2001)
	2000
12		Jean-Marc Champarnaud: Implicit Structures to Implement NFA's from Regular Expressions. CIAA 2000: 80-93
11		Jean-Marc Champarnaud, Djelloul Ziadi: New Finite Automaton Constructions Based on Canonical Derivatives. CIAA 2000: 94-104
	1999
10		Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi: Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers Springer 1999
9		Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte: SEA: A Symbolic Environment for Automata Theory. WIA 1999: 13-26
8		Djelloul Ziadi, Jean-Marc Champarnaud: An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. Theor. Comput. Sci. 215(1-2): 69-87 (1999)
	1998
7		Jean-Francis Michon, Jean-Marc Champarnaud: Automata and Binary Decision Diagrams. Workshop on Implementing Automata 1998: 178-182
6		Are Uppman, Jean-Marc Champarnaud: Autographe: A Graphical Version of Automate. Workshop on Implementing Automata 1998: 226-229
5		Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty: Determinization of Glushkov Automata. Workshop on Implementing Automata 1998: 57-68
	1996
4		Jean-Luc Ponty, Djelloul Ziadi, Jean-Marc Champarnaud: A New Quadratic Algorithm to Convert a Regular Expression into an Automaton. Workshop on Implementing Automata 1996: 109-119
	1992
3		Jean-Marc Champarnaud: A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. STACS 1992: 605-606
	1991
2		Jean-Marc Champarnaud, Georges Hansel: AUTOMATE, a Computing Package for Automata and Finite Semigroups. J. Symb. Comput. 12(2): 197-220 (1991)
	1989
1		Jean-Marc Champarnaud, Jean-Eric Pin: A maxmin problem on finite automata. Discrete Applied Mathematics 23(1): 91-96 (1989)

Coauthor Index

1	Philippe Andary	[9]
2	Baptiste Blanpain	[50]
3	Béatrice Bouchou-Markhoff (Béatrice Bouchou, Béatrice Markhoff)	[67]
4	Pascal Caron	[9] [57] [58] [59] [60] [63] [65] [67]
5	Fabien Coulon	[23] [24] [28] [32] [37] [38] [40] [42]
6	Tibor Csáki	[47] [48]
7	Jean-Philippe Dubernard	[50] [54] [55] [61] [62] [66]
8	Gérard Duchamp (Gérard Henry Edmond Duchamp)	[9] [18] [29]
9	Jason Eisner	[45]
10	Jacques Farré	[52] [64]
11	Marianne Flouret	[9]
12	Tamás Gaál	[22] [47] [48]
13	Franck Guingne	[22] [35] [41] [43] [44] [45] [52] [53] [64] [66]
14	Georges Hansel	[2] [21] [30] [33] [35] [41] [43]
15	Hadrien Jeanne	[54] [55] [61] [62] [66] [68]
16	Lauri Karttunen	[22]
17	André Kempe	[22] [44] [45] [47] [48] [53]
18	Éric Laugerotte	[9] [26] [31]
19	Denis Maurel	[10] [14] [27] [67]
20	Jean-Francis Michon	[7]
21	Ludovic Mignot	[57] [58] [59] [60] [63] [65] [68]
22	Florent Nicart	[22] [36] [44] [45] [46] [47] [48] [53]
23	Faissal Ouardi	[26] [31] [34] [49] [51] [56]
24	Thomas Paranthoën	[21] [25] [30] [32] [37] [39] [42]
25	Dominique Perrin	[33]
26	Jean-Eric Pin	[1]
27	Jean-Luc Ponty	[4] [5]
28	Are Uppman	[6]
29	Djelloul Ziadi	[4] [5] [8] [10] [11] [14] [15] [16] [17] [19] [21] [26] [30] [31] [34] [36] [46] [49] [51] [56]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page