Jean-Marc Champarnaud

Publication Activity (10 Years)

Years Active: 1989-2017
Publications (10 Years): 2

Top Topics

Regular Expressions

Pattern Matching

Finite Automata

Semistructured Data

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Discret. Math. Theor. Comput. Sci.

Publications

Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
Bottom-Up Quotients for Tree Languages. J. Autom. Lang. Comb. 22 (4) (2017)
Jean-Marc Champarnaud, Ludovic Mignot, Florent Nicart
Constrained Expressions and their Derivatives. Fundam. Informaticae 149 (3) (2016)
Faissal Ouardi, Jean-Marc Champarnaud, Djelloul Ziadi
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions. J. Discrete Algorithms 33 (2015)
Jean-Marc Champarnaud, Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
Bottom Up Quotients and Residuals for Tree Languages. CoRR (2015)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. Fundam. Informaticae 137 (4) (2015)
Jean-Marc Champarnaud, Ludovic Mignot, Florent Nicart
Constrained Expressions and their Derivatives. CoRR (2014)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
A general framework for the derivation of regular expressions. RAIRO Theor. Informatics Appl. 48 (3) (2014)
Jean-Marc Champarnaud, Quentin Cohen-Solal, Jean-Philippe Dubernard, Hadrien Jeanne
Enumeration of Specific Classes of Polycubes. Electron. J. Comb. 20 (4) (2013)
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions. CoRR (2013)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. LATA (2013)
Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
Derivatives of Approximate Regular Expressions. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
A generic method for the enumeration of various classes of directed polycubes. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions CoRR (2013)
Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel
Preface. Theor. Comput. Sci. 450 (2012)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Multi-Tilde-Bar Derivatives. CIAA (2012)
Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
Derivatives of Approximate Regular Expressions CoRR (2012)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Multi-tilde-bar expressions and their automata. Acta Informatica 49 (6) (2012)
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 (2012)
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)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
A General Framework for the Derivation of Regular Expressions CoRR (2012)
Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot
Approximate Regular Expressions and Their Derivatives. LATA (2012)
Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel
Obituary for Sheng Yu. Theor. Comput. Sci. 450 (2012)
Jean-Marc Champarnaud, Jacques Farré, Franck Guingne
Reduction Techniques for Acyclic Cover Transducers. Fundam. Informaticae 111 (4) (2011)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Multi-Bar and Multi-Tilde Regular Operators. J. Autom. Lang. Comb. 16 (1) (2011)
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) (2011)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Partial Derivatives of an Extended Regular Expression. LATA (2011)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne
Geometrical Regular Languages and Linear Diophantine Equations. DCFS (2011)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Acyclic automata and small expressions using multi-tilde-bar operators. Theor. Comput. Sci. 411 (38-39) (2010)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
Regular Geometrical Languages and Tiling the Plane. CIAA (2010)
Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne
Geometricity of Binary Regular Languages. LATA (2010)
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
An Efficient Computation of the Equation K-automaton of a Regular K-expression. Fundam. Informaticae 90 (1-2) (2009)
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) (2009)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Small Extended Expressions for Acyclic Automata. CIAA (2009)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
A New Family of Regular Operators Fitting with the Position Automaton Computation. SOFSEM (2009)
Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
Multi-tilde Operators and Their Glushkov Automata. LATA (2009)
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)
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) (2008)
Baptiste Blanpain, Jean-Marc Champarnaud, Jean-Philippe Dubernard
Geometrical Languages. LATA (2007)
Jean-Marc Champarnaud, Franck Guingne, Jacques Farré
Reducing Acyclic Cover Transducers. CIAA (2007)
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) (2007)
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
-Expression. Developments in Language Theory (2007)
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Normalized Expressions and Finite Automata. Int. J. Algebra Comput. 17 (1) (2007)
Florent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe
Multi-tape Automata with Symbol Classes. CIAA (2006)
Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi
From the ZPC Structure of a Regular Expression to its Follow Automaton. Int. J. Algebra Comput. 16 (1) (2006)
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) (2005)
Jean-Marc Champarnaud, Thomas Paranthoën
Random generation of DFAs. Theor. Comput. Sci. 330 (2) (2005)
André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart
WFSM Auto-intersection and Join Algorithms. FSMNLP (2005)
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) (2005)
Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
Similarity relations and cover automata. RAIRO Theor. Informatics Appl. 39 (1) (2005)
André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
-WFSM Auto-intersections. CIAA (2005)
Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
Cover transducers for functions with finite domain. Int. J. Found. Comput. Sci. 16 (5) (2005)
Jean-Marc Champarnaud, Fabien Coulon
Enumerating nondeterministic automata for a given language without constructing the canonical automaton. Int. J. Found. Comput. Sci. 16 (6) (2005)
Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
Reducing Cover Subsequential Transducers. DCFS (2004)
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
Brute Force Determinization of NFAs by Means of State Covers. CIAA (2004)
Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
From Regular Weighted Expressions To Finite Automata. Int. J. Found. Comput. Sci. 15 (5) (2004)
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81 (4) (2004)
Jean-Marc Champarnaud, Fabien Coulon
NFA reduction algorithms by means of regular inequalities. Theor. Comput. Sci. 327 (3) (2004)
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
Follow Automaton versus Equation Automaton. DCFS (2004)
Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi
Random Generation Models for NFAs. J. Autom. Lang. Comb. 9 (2/3) (2004)
Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin
Unavoidable Sets of Constant Length. Int. J. Algebra Comput. 14 (2) (2004)
Jean-Marc Champarnaud, Gérard Duchamp
Derivatives of rational expressions and related theorems. Theor. Comput. Sci. 313 (1) (2004)
Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi
Computing the Follow Automaton of an Expression. CIAA (2004)
Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
From Regular Weighted Expressions to Finite Automata. CIAA (2003)
Jean-Marc Champarnaud, Fabien Coulon
NFA Reduction Algorithms by Means of Regular Inequalities. Developments in Language Theory (2003)
Jean-Marc Champarnaud, Fabien Coulon
Theoretical study and implementation of the canonical automaton. Fundam. Informaticae 55 (1) (2003)
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) (2003)
Jean-Marc Champarnaud, Thomas Paranthoën
Random DFAs over a Non-Unary Alphabet. DCFS (2003)
Jean-Marc Champarnaud, Djelloul Ziadi
Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289 (1) (2002)
Jean-Marc Champarnaud, Ahmed Khorsi, Thomas Paranthoën
Split and join for minimizing: Brzozowski's algorithm. Stringology (2002)
Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi
NFAs bitstream-based random generation. DCFS (2002)
Jean-Marc Champarnaud
Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. Int. J. Found. Comput. Sci. 13 (1) (2002)
Jean-Marc Champarnaud, Djelloul Ziadi
Computing the Equation Automaton of a Regular Expression in Space and Time. CPM (2001)
Jean-Marc Champarnaud, Djelloul Ziadi
From Mirkin's Prebases to Antimirov's Word Partial Derivatives. Fundam. Informaticae 45 (3) (2001)
Jean-Marc Champarnaud, Gérard Duchamp
Brzozowski's Derivatives Extended to Multiplicities. CIAA (2001)
Jean-Marc Champarnaud
Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theor. Comput. Sci. 267 (1-2) (2001)
Jean-Marc Champarnaud, Djelloul Ziadi
From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. Int. J. Algebra Comput. 11 (6) (2001)
Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi
Foreword. Theor. Comput. Sci. 267 (1-2) (2001)
Jean-Marc Champarnaud
Implicit Structures to Implement NFA's from Regular Expressions. CIAA (2000)
Jean-Marc Champarnaud, Djelloul Ziadi
New Finite Automaton Constructions Based on Canonical Derivatives. CIAA (2000)
Djelloul Ziadi, Jean-Marc Champarnaud
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. Theor. Comput. Sci. 215 (1-2) (1999)
Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte
SEA: A Symbolic Environment for Automata Theory. WIA (1999)
Jean-Marc Champarnaud, Jean-Luc Ponty, Djelloul Ziadi
From regular expressions to finite automata. Int. J. Comput. Math. 72 (4) (1999)
Jean-Francis Michon, Jean-Marc Champarnaud
Automata and Binary Decision Diagrams. Workshop on Implementing Automata (1998)
Are Uppman, Jean-Marc Champarnaud
Autographe: A Graphical Version of Automate. Workshop on Implementing Automata (1998)
Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty
Determinization of Glushkov Automata. Workshop on Implementing Automata (1998)
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)
Jean-Marc Champarnaud
A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. STACS (1992)
Jean-Marc Champarnaud, Georges Hansel
AUTOMATE, a Computing Package for Automata and Finite Semigroups. J. Symb. Comput. 12 (2) (1991)
Jean-Marc Champarnaud, Jean-Eric Pin
A maxmin problem on finite automata. Discret. Appl. Math. 23 (1) (1989)