BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Czech Republic
1 × Finland
1 × Hungary
1 × Portugal
1 × South Africa
2 × France
2 × Germany
2 × Taiwan
2 × USA
4 × Canada
4 × Spain
Collaborated with:
J.Dubernard H.Jeanne D.Ziadi L.Mignot P.Caron F.Coulon F.Nicart T.Paranthoën G.Duchamp J.Ponty A.Kempe F.Ouardi F.Guingne J.Michon A.Uppman É.Laugerotte T.Csáki T.Gaál J.Farré B.Blanpain M.Béal S.Lombardy J.Eisner P.Andary M.Flouret
Talks about:
regular (14) express (11) automata (9) languag (6) geometr (6) deriv (6) automaton (5) binari (4) multi (4) algorithm (3)

Person: Jean-Marc Champarnaud

DBLP DBLP: Champarnaud:Jean=Marc

Facilitated 3 volumes:

CIAA 2011Ed
CIAA 2002Ed
WIA 1998Ed

Contributed to:

LATA 20132013
CIAA 20122012
DLT 20122012
LATA 20122012
LATA 20112011
CIAA 20102010
LATA 20102010
CIAA 20092009
LATA 20092009
CIAA 20082008
CIAA 20082009
CIAA 20072007
DLT 20072007
LATA 20072007
CIAA 20062006
CIAA 20062007
CIAA 20052005
CIAA 20042004
CIAA 20042005
CIAA 20032003
DLT 20032003
CIAA 20012001
CIAA 20002000
CIAA 20002002
WIA 19991999
WIA 19981998
WIA 19961996

Wrote 31 papers:

LATA-2013-ChamparnaudDJM #regular expression
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (JMC, JPD, HJ, LM), pp. 202–213.
CIAA-2012-CaronCM #multi
Multi-Tilde-Bar Derivatives (PC, JMC, LM), pp. 321–328.
DLT-2012-BealCDJL #decidability #geometry #regular expression
Decidability of Geometricity of Regular Languages (MPB, JMC, JPD, HJ, SL), pp. 62–72.
LATA-2012-ChamparnaudJM #approximate #regular expression
Approximate Regular Expressions and Their Derivatives (JMC, HJ, LM), pp. 179–191.
LATA-2011-CaronCM #regular expression
Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
CIAA-2010-ChamparnaudDJ #geometry
Regular Geometrical Languages and Tiling the Plane (JMC, JPD, HJ), pp. 69–78.
LATA-2010-ChamparnaudDJ #geometry #regular expression
Geometricity of Binary Regular Languages (JMC, JPD, HJ), pp. 178–189.
CIAA-2009-CaronCM #automaton
Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.
LATA-2009-CaronCM #automaton #multi
Multi-tilde Operators and Their Glushkov Automata (PC, JMC, LM), pp. 290–301.
CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.
CIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #performance #regular expression
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.
CIAA-2007-ChamparnaudGF #transducer
Reducing Acyclic Cover Transducers (JMC, FG, JF), pp. 38–50.
DLT-2007-ChamparnaudOZ #equation #performance
An Efficient Computation of the Equation K-Automaton of a Regular K-Expression (JMC, FO, DZ), pp. 145–156.
LATA-2007-BlanpainCD #geometry
Geometrical Languages (BB, JMC, JPD), pp. 127–138.
CIAA-2006-NicartCCGK #automaton #multi
Multi-tape Automata with Symbol Classes (FN, JMC, TC, TG, AK), pp. 126–136.
CIAA-J-2006-NicartCCGK07 #automaton #multi
Labelling Multi-Tape Automata with Constrained Symbol Classes (FN, JMC, TC, TG, AK), pp. 847–858.
A Class of Rational n-WFSM Auto-intersections (AK, JMC, JE, FG, FN), pp. 188–198.
Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.
CIAA-2004-ChamparnaudNZ #automaton
Computing the Follow Automaton of an Expression (JMC, FN, DZ), pp. 90–101.
Brute force determinization of nfas by means of state covers (JMC, FC, TP), pp. 441–451.
CIAA-2003-ChamparnaudLOZ #automaton #finite
From Regular Weighted Expressions to Finite Automata (JMC, ÉL, FO, DZ), pp. 49–60.
DLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction
NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
CIAA-2001-ChamparnaudD #multi
Brzozowski’s Derivatives Extended to Multiplicities (JMC, GD), pp. 52–64.
CIAA-2000-Champarnaud #automaton #nondeterminism #regular expression
Implicit Structures to Implement NFA’s from Regular Expressions (JMC), pp. 80–93.
CIAA-2000-ChamparnaudZ #automaton #canonical #finite
New Finite Automaton Constructions Based on Canonical Derivatives (JMC, DZ), pp. 94–104.
CIAA-J-2000-Champarnaud02 #automaton #evaluation #nondeterminism #regular expression
Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions (JMC), pp. 99–113.
WIA-1999-AndaryCCDFL #automaton #named
SEA: A Symbolic Environment for Automata Theory (PA, PC, JMC, GD, MF, ÉL), pp. 13–26.
WIA-1998-ChamparnaudZP #automaton
Determinization of Glushkov Automata (JMC, DZ, JLP), pp. 57–68.
WIA-1998-MichonC #automaton #diagrams
Automata and Binary Decision Diagrams (JFM, JMC), pp. 178–182.
WIA-1998-UppmanC #named #visual notation
Autographe: A Graphical Version of Automate (AU, JMC), pp. 226–229.
WIA-1996-PontyZC #algorithm #automaton #polynomial #regular expression
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton (JLP, DZ, JMC), pp. 109–119.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.