The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Marc Champarnaud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Marc Champarnaud, Djelloul Ziadi
    Computing the Equation Automaton of a Regular Expression in Space and Time. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:157-168 [Conf]
  2. Jean-Marc Champarnaud, Fabien Coulon
    NFA Reduction Algorithms by Means of Regular Inequalities. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:194-205 [Conf]
  3. Jean-Marc Champarnaud
    A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:605-606 [Conf]
  4. Jean-Marc Champarnaud, Djelloul Ziadi, Jean-Luc Ponty
    Determinization of Glushkov Automata. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:57-68 [Conf]
  5. Jean-Marc Champarnaud, Gérard Duchamp
    Brzozowski's Derivatives Extended to Multiplicities. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:52-64 [Conf]
  6. Philippe Andary, Pascal Caron, Jean-Marc Champarnaud, Gérard Duchamp, Marianne Flouret, Éric Laugerotte
    SEA: A Symbolic Environment for Automata Theory. [Citation Graph (0, 0)][DBLP]
    WIA, 1999, pp:13-26 [Conf]
  7. Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
    From Regular Weighted Expressions to Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:49-60 [Conf]
  8. Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi
    Computing the Follow Automaton of an Expression. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:90-101 [Conf]
  9. Jean-Marc Champarnaud
    Implicit Structures to Implement NFA's from Regular Expressions. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:80-93 [Conf]
  10. Jean-Marc Champarnaud, Djelloul Ziadi
    New Finite Automaton Constructions Based on Canonical Derivatives. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:94-104 [Conf]
  11. Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
    Brute Force Determinization of NFAs by Means of State Covers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:80-89 [Conf]
  12. André Kempe, Jean-Marc Champarnaud, Jason Eisner, Franck Guingne, Florent Nicart
    A Class of Rational n-WFSM Auto-intersections. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:188-198 [Conf]
  13. Jean-Francis Michon, Jean-Marc Champarnaud
    Automata and Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:178-182 [Conf]
  14. Jean-Luc Ponty, Djelloul Ziadi, Jean-Marc Champarnaud
    A New Quadratic Algorithm to Convert a Regular Expression into an Automaton. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1996, pp:109-119 [Conf]
  15. Are Uppman, Jean-Marc Champarnaud
    Autographe: A Graphical Version of Automate. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:226-229 [Conf]
  16. Florent Nicart, Jean-Marc Champarnaud, T. Csáki, Tamás Gaál, André Kempe
    Multi-tape Automata with Symbol Classes. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:126-136 [Conf]
  17. André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart
    WFSM Auto-intersection and Join Algorithms. [Citation Graph (0, 0)][DBLP]
    FSMNLP, 2005, pp:120-131 [Conf]
  18. Jean-Marc Champarnaud, Fabien Coulon
    Theoretical study and implementation of the canonical automaton. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:1, pp:23-38 [Journal]
  19. Jean-Marc Champarnaud, Djelloul Ziadi
    From Mirkin's Prebases to Antimirov's Word Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:195-205 [Journal]
  20. Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin
    Unavoidable Sets of Constant Length. [Citation Graph (0, 0)][DBLP]
    IJAC, 2004, v:14, n:2, pp:241-251 [Journal]
  21. Jean-Marc Champarnaud, Florent Nicart, Djelloul Ziadi
    From the ZPC Structure of a Regular Expression to its Follow Automaton. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:1, pp:17-34 [Journal]
  22. Jean-Marc Champarnaud, Djelloul Ziadi
    From C-Continuations to New Quadratic Algorithms for Automaton Synthesis. [Citation Graph (0, 0)][DBLP]
    IJAC, 2001, v:11, n:6, pp:707-736 [Journal]
  23. Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
    Compact and fast algorithms for safe regular expression search. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:4, pp:383-401 [Journal]
  24. Jean-Marc Champarnaud
    Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:99-113 [Journal]
  25. Jean-Marc Champarnaud, Fabien Coulon, Thomas Paranthoën
    Brute force determinization of nfas by means of state covers. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:441-451 [Journal]
  26. Jean-Marc Champarnaud, Fabien Coulon
    Enumerating nondeterministic automata for a given language without constructing the canonical automaton. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1253-1266 [Journal]
  27. Jean-Marc Champarnaud, Franck Guingne, Georges Hansel
    Cover transducers for functions with finite domain. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:851-865 [Journal]
  28. Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi, Djelloul Ziadi
    From Regular Weighted Expressions To Finite Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:5, pp:687-700 [Journal]
  29. Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe
    Virtual Operations On Virtual Networks: The Priority Union . [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1055-1071 [Journal]
  30. Jean-Marc Champarnaud, Georges Hansel
    AUTOMATE, a Computing Package for Automata and Finite Semigroups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:2, pp:197-220 [Journal]
  31. Jean-Marc Champarnaud, Thomas Paranthoën
    Random generation of DFAs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:221-235 [Journal]
  32. Jean-Marc Champarnaud, Fabien Coulon
    NFA reduction algorithms by means of regular inequalities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:3, pp:241-253 [Journal]
  33. Jean-Marc Champarnaud, Fabien Coulon
    Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:437-440 [Journal]
  34. Jean-Marc Champarnaud, Djelloul Ziadi
    Canonical derivatives, partial derivatives and finite automaton constructions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:137-163 [Journal]
  35. Jean-Marc Champarnaud
    Subset construction complexity for homogeneous automata, position automata and ZPC-structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:17-34 [Journal]
  36. Jean-Marc Champarnaud, Gérard Duchamp
    Derivatives of rational expressions and related theorems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:1, pp:31-44 [Journal]
  37. Jean-Marc Champarnaud, Denis Maurel, Djelloul Ziadi
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:1- [Journal]
  38. Djelloul Ziadi, Jean-Marc Champarnaud
    An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:69-87 [Journal]
  39. Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Ziadi
    An Efficient Computation of the Equation K-Automaton of a Regular K-Expression. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:145-156 [Conf]
  40. Jean-Marc Champarnaud, Franck Guingne, Jacques Farré
    Reducing Acyclic Cover Transducers. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:38-50 [Conf]

  41. A New Family of Regular Operators Fitting with the Position Automaton Computation. [Citation Graph (, )][DBLP]


  42. Small Extended Expressions for Acyclic Automata. [Citation Graph (, )][DBLP]


  43. Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). [Citation Graph (, )][DBLP]


  44. Multi-tilde Operators and Their Glushkov Automata. [Citation Graph (, )][DBLP]


  45. Geometricity of Binary Regular Languages. [Citation Graph (, )][DBLP]


  46. A maxmin problem on finite automata. [Citation Graph (, )][DBLP]


Search in 0.045secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002