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.
Jean-Marc Champarnaud
2010 – today
- 2013
[j38]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: A generic method for the enumeration of various classes of directed polycubes. Discrete Mathematics & Theoretical Computer Science 15(1): 183-200 (2013)- [c37]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot: Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. LATA 2013: 202-213
- [i3]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot: Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. CoRR abs/1301.3316 (2013)
- 2012
- [j37]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Multi-tilde-bar expressions and their automata. Acta Inf. 49(6): 413-436 (2012)
- [j36]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne: Geometrical regular languages and linear Diophantine equations: The strongly connected case. Theor. Comput. Sci. 449: 54-63 (2012)
- [j35]Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel: Obituary for Sheng Yu. Theor. Comput. Sci. 450: 1 (2012)
- [j34]Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel: Preface. Theor. Comput. Sci. 450: 2 (2012)
- [c36]Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy: Decidability of Geometricity of Regular Languages. Developments in Language Theory 2012: 62-72
- [c35]Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot: Approximate Regular Expressions and Their Derivatives. LATA 2012: 179-191
- [c34]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Multi-Tilde-Bar Derivatives. CIAA 2012: 321-328
- [i2]Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot: Derivatives of Approximate Regular Expressions. CoRR abs/1205.1825 (2012)
- [i1]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: A General Framework for the Derivation of Regular Expressions. CoRR abs/1212.5003 (2012)
- 2011
- [j33]Jean-Marc Champarnaud, Jacques Farré, Franck Guingne: Reduction Techniques for Acyclic Cover Transducers. Fundam. Inform. 111(4): 357-371 (2011)
- [j32]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Multi-Bar and Multi-Tilde Regular Operators. Journal of Automata, Languages and Combinatorics 16(1): 11-26 (2011)
- [j31]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)
- [c33]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne: Geometrical Regular Languages and Linear Diophantine Equations. DCFS 2011: 107-120
- [c32]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Partial Derivatives of an Extended Regular Expression. LATA 2011: 179-191
- [e3]Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel (Eds.): Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings. Lecture Notes in Computer Science 6807, Springer 2011, ISBN 978-3-642-22255-9
- 2010
- [j30]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)
- [c31]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Geometricity of Binary Regular Languages. LATA 2010: 178-189
- [c30]Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne: Regular Geometrical Languages and Tiling the Plane. CIAA 2010: 69-78
2000 – 2009
- 2009
- [j29]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)
- [j28]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)
- [c29]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Multi-tilde Operators and Their Glushkov Automata. LATA 2009: 290-301
- [c28]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: A New Family of Regular Operators Fitting with the Position Automaton Computation. SOFSEM 2009: 645-655
- [c27]Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot: Small Extended Expressions for Acyclic Automata. CIAA 2009: 198-207
- 2008
- [j27]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)
- [c26]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
- 2007
- [j26]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: Normalized Expressions and Finite Automata. IJAC 17(1): 141-154 (2007)
- [j25]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)
- [c25]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
- [c24]Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard: Geometrical Languages. LATA 2007: 127-138
- [c23]Jean-Marc Champarnaud, Franck Guingne, Jacques Farré: Reducing Acyclic Cover Transducers. CIAA 2007: 38-50
- 2006
- [j24]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)
- [c22]Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe: Multi-tape Automata with Symbol Classes. CIAA 2006: 126-136
- 2005
- [j23]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)
- [j22]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16(5): 851-865 (2005)
- [j21]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)
- [j20]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Similarity relations and cover automata. ITA 39(1): 115-123 (2005)
- [j19]Jean-Marc Champarnaud, Thomas Paranthoën: Random generation of DFAs. Theor. Comput. Sci. 330(2): 221-235 (2005)
- [j18]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)
- [c21]André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart: WFSM Auto-intersection and Join Algorithms. FSMNLP 2005: 120-131
- [c20]André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart: A Class of Rational n-WFSM Auto-intersections. CIAA 2005: 188-198
- 2004
- [j17]Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin: Unavoidable Sets of Constant Length. IJAC 14(2): 241-251 (2004)
- [j16]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)
- [j15]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)
- [j14]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)
- [j13]Jean-Marc Champarnaud, Gérard Duchamp: Derivatives of rational expressions and related theorems. Theor. Comput. Sci. 313(1): 31-44 (2004)
- [j12]Jean-Marc Champarnaud, Fabien Coulon: NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327(3): 241-253 (2004)
- [c19]Jean-Marc Champarnaud, Franck Guingne, Georges Hansel: Reducing Cover Subsequential Transducers. DCFS 2004: 131-144
- [c18]Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi: Follow Automaton versus Equation Automaton. DCFS 2004: 145-153
- [c17]Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën: Brute Force Determinization of NFAs by Means of State Covers. CIAA 2004: 80-89
- [c16]Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi: Computing the Follow Automaton of an Expression. CIAA 2004: 90-101
- 2003
- [j11]Jean-Marc Champarnaud, Fabien Coulon: Theoretical study and implementation of the canonical automaton. Fundam. Inform. 55(1): 23-38 (2003)
- [j10]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)
- [c15]
- [c14]Jean-Marc Champarnaud, Fabien Coulon: NFA Reduction Algorithms by Means of Regular Inequalities. Developments in Language Theory 2003: 194-205
- [c13]Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi: From Regular Weighted Expressions to Finite Automata. CIAA 2003: 49-60
- [e2]Jean-Marc Champarnaud, Denis Maurel (Eds.): Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers. Lecture Notes in Computer Science 2608, Springer 2003, ISBN 3-540-40391-4
- 2002
- [j9]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)
- [j8]Jean-Marc Champarnaud, Djelloul Ziadi: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1): 137-163 (2002)
- [c12]Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi: NFAs bitstream-based random generation. DCFS 2002: 81-94
- [c11]Jean-Marc Champarnaud, Ahmed Khorsi, Thomas Paranthoën: Split and join for minimizing: Brzozowski's algorithm. Stringology 2002: 96-104
- 2001
- [j7]Jean-Marc Champarnaud, Djelloul Ziadi: From Mirkin's Prebases to Antimirov's Word Partial Derivatives. Fundam. Inform. 45(3): 195-205 (2001)
- [j6]Jean-Marc Champarnaud, Djelloul Ziadi: From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. IJAC 11(6): 707-736 (2001)
- [j5]Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi: Foreword. Theor. Comput. Sci. 267(1-2): 1 (2001)
- [j4]Jean-Marc Champarnaud: Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theor. Comput. Sci. 267(1-2): 17-34 (2001)
- [c10]Jean-Marc Champarnaud, Djelloul Ziadi: Computing the Equation Automaton of a Regular Expression in Space and Time. CPM 2001: 157-168
- [c9]Jean-Marc Champarnaud, Gérard Duchamp: Brzozowski's Derivatives Extended to Multiplicities. CIAA 2001: 52-64
- 2000
- [c8]Jean-Marc Champarnaud: Implicit Structures to Implement NFA's from Regular Expressions. CIAA 2000: 80-93
- [c7]Jean-Marc Champarnaud, Djelloul Ziadi: New Finite Automaton Constructions Based on Canonical Derivatives. CIAA 2000: 94-104
1990 – 1999
- 1999
- [j3]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)
- [c6]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
- [e1]Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi (Eds.): Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers. Lecture Notes in Computer Science 1660, Springer 1999, ISBN 3-540-66652-4
- 1998
- [c5]Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty: Determinization of Glushkov Automata. Workshop on Implementing Automata 1998: 57-68
- [c4]Jean-Francis Michon, Jean-Marc Champarnaud: Automata and Binary Decision Diagrams. Workshop on Implementing Automata 1998: 178-182
- [c3]Are Uppman, Jean-Marc Champarnaud: Autographe: A Graphical Version of Automate. Workshop on Implementing Automata 1998: 226-229
- 1996
- [c2]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
- [c1]Jean-Marc Champarnaud: A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. STACS 1992: 605-606
- 1991
- [j2]Jean-Marc Champarnaud, Georges Hansel: AUTOMATE, a Computing Package for Automata and Finite Semigroups. J. Symb. Comput. 12(2): 197-220 (1991)
1980 – 1989
- 1989
- [j1]Jean-Marc Champarnaud, Jean-Eric Pin: A maxmin problem on finite automata. Discrete Applied Mathematics 23(1): 91-96 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-01 22:24 CEST by the dblp team