A maxmin problem on finite automata. - Jean-Marc Champarnaud; Jean-Eric Pin (Discret. Appl. Math., 1989)

AUTOMATE, a Computing Package for Automata and Finite Semigroups. - Jean-Marc Champarnaud; Georges Hansel (J. Symb. Comput., 1991)

A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. - Jean-Marc Champarnaud (STACS, 1992)

A New Quadratic Algorithm to Convert a Regular Expression into an Automaton. - Jean-Luc Ponty; Djelloul Ziadi; Jean-Marc Champarnaud (Workshop on Implementing Automata, 1996)

Determinization of Glushkov Automata. - Jean-Marc Champarnaud; Djelloul Ziadi; Jean-Luc Ponty (Workshop on Implementing Automata, 1998)

Automata and Binary Decision Diagrams. - Jean-Francis Michon; Jean-Marc Champarnaud (Workshop on Implementing Automata, 1998)

Autographe: A Graphical Version of Automate. - Are Uppman; Jean-Marc Champarnaud (Workshop on Implementing Automata, 1998)

SEA: A Symbolic Environment for Automata Theory. - Philippe Andary; Pascal Caron; Jean-Marc Champarnaud; Gérard Duchamp; Marianne Flouret; Éric Laugerotte (WIA, 1999)

From regular expressions to finite automata. - Jean-Marc Champarnaud; Jean-Luc Ponty; Djelloul Ziadi (Int. J. Comput. Math., 1999)

An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. - Djelloul Ziadi; Jean-Marc Champarnaud (Theor. Comput. Sci., 1999)

Implicit Structures to Implement NFA's from Regular Expressions. - Jean-Marc Champarnaud (CIAA, 2000)

New Finite Automaton Constructions Based on Canonical Derivatives. - Jean-Marc Champarnaud; Djelloul Ziadi (CIAA, 2000)

Computing the Equation Automaton of a Regular Expression in Space and Time. - Jean-Marc Champarnaud; Djelloul Ziadi (CPM, 2001)

Brzozowski's Derivatives Extended to Multiplicities. - Jean-Marc Champarnaud; Gérard Duchamp (CIAA, 2001)

From Mirkin's Prebases to Antimirov's Word Partial Derivatives. - Jean-Marc Champarnaud; Djelloul Ziadi (Fundam. Informaticae, 2001)

From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. - Jean-Marc Champarnaud; Djelloul Ziadi (Int. J. Algebra Comput., 2001)

Subset construction complexity for homogeneous automata, position automata and ZPC-structures. - Jean-Marc Champarnaud (Theor. Comput. Sci., 2001)

Foreword. - Jean-Marc Champarnaud; Denis Maurel; Djelloul Ziadi (Theor. Comput. Sci., 2001)

NFAs bitstream-based random generation. - Jean-Marc Champarnaud; Georges Hansel; Thomas Paranthoën; Djelloul Ziadi (DCFS, 2002)

Split and join for minimizing: Brzozowski's algorithm. - Jean-Marc Champarnaud; Ahmed Khorsi; Thomas Paranthoën (Stringology, 2002)

Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. - Jean-Marc Champarnaud (Int. J. Found. Comput. Sci., 2002)

Canonical derivatives, partial derivatives and finite automaton constructions. - Jean-Marc Champarnaud; Djelloul Ziadi (Theor. Comput. Sci., 2002)

Random DFAs over a Non-Unary Alphabet. - Jean-Marc Champarnaud; Thomas Paranthoën (DCFS, 2003)

Theoretical study and implementation of the canonical automaton. - Jean-Marc Champarnaud; Fabien Coulon (Fundam. Informaticae, 2003)

Virtual Operations On Virtual Networks: The Priority Union . - Franck Guingne; Florent Nicart; Jean-Marc Champarnaud; Lauri Karttunen; Tamás Gaál; André Kempe (Int. J. Found. Comput. Sci., 2003)

Reducing Cover Subsequential Transducers. - Jean-Marc Champarnaud; Franck Guingne; Georges Hansel (DCFS, 2004)

Follow Automaton versus Equation Automaton. - Jean-Marc Champarnaud; Faissal Ouardi; Djelloul Ziadi (DCFS, 2004)

Computing the Follow Automaton of an Expression. - Jean-Marc Champarnaud; Florent Nicart; Djelloul Ziadi (CIAA, 2004)

Unavoidable Sets of Constant Length. - Jean-Marc Champarnaud; Georges Hansel; Dominique Perrin (Int. J. Algebra Comput., 2004)

Compact and fast algorithms for safe regular expression search. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Comput. Math., 2004)

From Regular Weighted Expressions To Finite Automata. - Jean-Marc Champarnaud; Éric Laugerotte; Faissal Ouardi; Djelloul Ziadi (Int. J. Found. Comput. Sci., 2004)

Random Generation Models for NFAs. - Jean-Marc Champarnaud; Georges Hansel; Thomas Paranthoën; Djelloul Ziadi (J. Autom. Lang. Comb., 2004)

NFA reduction algorithms by means of regular inequalities. - Jean-Marc Champarnaud; Fabien Coulon (Theor. Comput. Sci., 2004)

Derivatives of rational expressions and related theorems. - Jean-Marc Champarnaud; Gérard Duchamp (Theor. Comput. Sci., 2004)

WFSM Auto-intersection and Join Algorithms. - André Kempe; Jean-Marc Champarnaud; Franck Guingne; Florent Nicart (FSMNLP, 2005)

A Class of Rational n-WFSM Auto-intersections. - André Kempe; Jean-Marc Champarnaud; Jason Eisner; Franck Guingne; Florent Nicart (CIAA, 2005)

Enumerating nondeterministic automata for a given language without constructing the canonical automaton. - Jean-Marc Champarnaud; Fabien Coulon (Int. J. Found. Comput. Sci., 2005)

Brute force determinization of nfas by means of state covers. - Jean-Marc Champarnaud; Fabien Coulon; Thomas Paranthoën (Int. J. Found. Comput. Sci., 2005)

Cover transducers for functions with finite domain. - Jean-Marc Champarnaud; Franck Guingne; Georges Hansel (Int. J. Found. Comput. Sci., 2005)

Similarity relations and cover automata. - Jean-Marc Champarnaud; Franck Guingne; Georges Hansel (RAIRO Theor. Informatics Appl., 2005)

Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. - Jean-Marc Champarnaud; Fabien Coulon (Theor. Comput. Sci., 2005)

Random generation of DFAs. - Jean-Marc Champarnaud; Thomas Paranthoën (Theor. Comput. Sci., 2005)

Multi-tape Automata with Symbol Classes. - Florent Nicart; Jean-Marc Champarnaud; Tibor Csáki; Tamás Gaál; André Kempe (CIAA, 2006)

From the ZPC Structure of a Regular Expression to its Follow Automaton. - Jean-Marc Champarnaud; Florent Nicart; Djelloul Ziadi (Int. J. Algebra Comput., 2006)

An Efficient Computation of the Equation K-Automaton of a Regular K-Expression. - Jean-Marc Champarnaud; Faissal Ouardi; Djelloul Ziadi (Developments in Language Theory, 2007)

Geometrical Languages. - Baptiste Blanpain; Jean-Marc Champarnaud; Jean-Philippe Dubernard (LATA, 2007)

Reducing Acyclic Cover Transducers. - Jean-Marc Champarnaud; Franck Guingne; Jacques Farré (CIAA, 2007)

Normalized Expressions and Finite Automata. - Jean-Marc Champarnaud; Faissal Ouardi; Djelloul Ziadi (Int. J. Algebra Comput., 2007)

Labelling Multi-Tape Automata with Constrained Symbol Classes. - Florent Nicart; Jean-Marc Champarnaud; Tibor Csáki; Tamás Gaál; André Kempe (Int. J. Found. Comput. Sci., 2007)

Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne (CIAA, 2008)

Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines. - Jean-Marc Champarnaud; Franck Guingne; André Kempe; Florent Nicart (Int. J. Found. Comput. Sci., 2008)

Multi-tilde Operators and Their Glushkov Automata. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (LATA, 2009)

A New Family of Regular Operators Fitting with the Position Automaton Computation. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (SOFSEM, 2009)

Small Extended Expressions for Acyclic Automata. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (CIAA, 2009)

An Efficient Computation of the Equation K-automaton of a Regular K-expression. - Jean-Marc Champarnaud; Faissal Ouardi; Djelloul Ziadi (Fundam. Informaticae, 2009)

An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne (Int. J. Found. Comput. Sci., 2009)

Geometricity of Binary Regular Languages. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne (LATA, 2010)

Regular Geometrical Languages and Tiling the Plane. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne (CIAA, 2010)

Acyclic automata and small expressions using multi-tilde-bar operators. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (Theor. Comput. Sci., 2010)

Geometrical Regular Languages and Linear Diophantine Equations. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Franck Guingne; Hadrien Jeanne (DCFS, 2011)

Partial Derivatives of an Extended Regular Expression. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (LATA, 2011)

Reduction Techniques for Acyclic Cover Transducers. - Jean-Marc Champarnaud; Jacques Farré; Franck Guingne (Fundam. Informaticae, 2011)

Multi-Bar and Multi-Tilde Regular Operators. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (J. Autom. Lang. Comb., 2011)

Erratum to "Acyclic automata and small expressions using multi-tilde-bar operators" [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (Theor. Comput. Sci., 2011)

Decidability of Geometricity of Regular Languages. - Marie-Pierre Béal; Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne; Sylvain Lombardy (Developments in Language Theory, 2012)

Approximate Regular Expressions and Their Derivatives. - Jean-Marc Champarnaud; Hadrien Jeanne; Ludovic Mignot (LATA, 2012)

Multi-Tilde-Bar Derivatives. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (CIAA, 2012)

Multi-tilde-bar expressions and their automata. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (Acta Informatica, 2012)

Obituary for Sheng Yu. - Béatrice Bouchou-Markhoff; Pascal Caron; Jean-Marc Champarnaud; Denis Maurel (Theor. Comput. Sci., 2012)

Preface. - Béatrice Bouchou-Markhoff; Pascal Caron; Jean-Marc Champarnaud; Denis Maurel (Theor. Comput. Sci., 2012)

Geometrical regular languages and linear Diophantine equations: The strongly connected case. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Franck Guingne; Hadrien Jeanne (Theor. Comput. Sci., 2012)

Enumeration of Specific Classes of Polycubes. - Jean-Marc Champarnaud; Quentin Cohen-Solal; Jean-Philippe Dubernard; Hadrien Jeanne (Electron. J. Comb., 2013)

A generic method for the enumeration of various classes of directed polycubes. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne (Discret. Math. Theor. Comput. Sci., 2013)

Derivatives of Approximate Regular Expressions. - Jean-Marc Champarnaud; Hadrien Jeanne; Ludovic Mignot (Discret. Math. Theor. Comput. Sci., 2013)

A general framework for the derivation of regular expressions. - Pascal Caron; Jean-Marc Champarnaud; Ludovic Mignot (RAIRO Theor. Informatics Appl., 2014)

Bottom Up Quotients and Residuals for Tree Languages. - Jean-Marc Champarnaud; Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (CoRR, 2015)

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions. - Jean-Marc Champarnaud; Jean-Philippe Dubernard; Hadrien Jeanne; Ludovic Mignot (Fundam. Informaticae, 2015)

Extended to multi-tilde-bar regular expressions and efficient finite automata constructions. - Faissal Ouardi; Jean-Marc Champarnaud; Djelloul Ziadi (J. Discrete Algorithms, 2015)

Constrained Expressions and their Derivatives. - Jean-Marc Champarnaud; Ludovic Mignot; Florent Nicart (Fundam. Informaticae, 2016)

Bottom-Up Quotients for Tree Languages. - Jean-Marc Champarnaud; Ludovic Mignot; Nadia Ouali Sebti; Djelloul Ziadi (J. Autom. Lang. Comb., 2017)