Jean-Marc Champarnaud

According to our database1, Jean-Marc Champarnaud
  • authored at least 87 papers between 1989 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Constrained Expressions and their Derivatives.
Fundam. Inform., 2016

2015
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions.
J. Discrete Algorithms, 2015

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.
Fundam. Inform., 2015

Bottom Up Quotients and Residuals for Tree Languages.
CoRR, 2015

2014
A general framework for the derivation of regular expressions.
RAIRO - Theor. Inf. and Applic., 2014

Constrained Expressions and their Derivatives.
CoRR, 2014

2013
Derivatives of Approximate Regular Expressions.
Discrete Mathematics & Theoretical Computer Science, 2013

A generic method for the enumeration of various classes of directed polycubes.
Discrete Mathematics & Theoretical Computer Science, 2013

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
CoRR, 2013

Extended to Multi-Tilde-Bar Regular Expressions and Efficient Finite Automata Constructions.
CoRR, 2013

Enumeration of Specific Classes of Polycubes.
Electr. J. Comb., 2013

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Geometrical regular languages and linear Diophantine equations: The strongly connected case.
Theor. Comput. Sci., 2012

Preface.
Theor. Comput. Sci., 2012

Obituary for Sheng Yu.
Theor. Comput. Sci., 2012

A General Framework for the Derivation of Regular Expressions
CoRR, 2012

Derivatives of Approximate Regular Expressions
CoRR, 2012

Multi-tilde-bar expressions and their automata.
Acta Inf., 2012

Multi-Tilde-Bar Derivatives.
Proceedings of the Implementation and Application of Automata, 2012

Approximate Regular Expressions and Their Derivatives.
Proceedings of the Language and Automata Theory and Applications, 2012

Decidability of Geometricity of Regular Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Erratum to "Acyclic automata and small expressions using multi-tilde-bar operators" [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435].
Theor. Comput. Sci., 2011

Multi-Bar and Multi-Tilde Regular Operators.
Journal of Automata, Languages and Combinatorics, 2011

Reduction Techniques for Acyclic Cover Transducers.
Fundam. Inform., 2011

Partial Derivatives of an Extended Regular Expression.
Proceedings of the Language and Automata Theory and Applications, 2011

Geometrical Regular Languages and Linear Diophantine Equations.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Acyclic automata and small expressions using multi-tilde-bar operators.
Theor. Comput. Sci., 2010

Regular Geometrical Languages and Tiling the Plane.
Proceedings of the Implementation and Application of Automata, 2010

Geometricity of Binary Regular Languages.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical.
Int. J. Found. Comput. Sci., 2009

An Efficient Computation of the Equation K-automaton of a Regular K-expression.
Fundam. Inform., 2009

Small Extended Expressions for Acyclic Automata.
Proceedings of the Implementation and Application of Automata, 2009

A New Family of Regular Operators Fitting with the Position Automaton Computation.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Multi-tilde Operators and Their Glushkov Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
Algorithms for the Join and Auto-Intersection of Multi-Tape Weighted Finite-State Machines.
Int. J. Found. Comput. Sci., 2008

Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L).
Proceedings of the Implementation and Applications of Automata, 2008

2007
Labelling Multi-Tape Automata with Constrained Symbol Classes.
Int. J. Found. Comput. Sci., 2007

Normalized Expressions and Finite Automata.
IJAC, 2007

Reducing Acyclic Cover Transducers.
Proceedings of the Implementation and Application of Automata, 2007

Geometrical Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

An Efficient Computation of the Equation K-Automaton of a Regular K-Expression.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
From the ZPC Structure of a Regular Expression to its Follow Automaton.
IJAC, 2006

Multi-tape Automata with Symbol Classes.
Proceedings of the Implementation and Application of Automata, 2006

2005
Random generation of DFAs.
Theor. Comput. Sci., 2005

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

Similarity relations and cover automata.
ITA, 2005

Cover transducers for functions with finite domain.
Int. J. Found. Comput. Sci., 2005

Brute force determinization of nfas by means of state covers.
Int. J. Found. Comput. Sci., 2005

Enumerating nondeterministic automata for a given language without constructing the canonical automaton.
Int. J. Found. Comput. Sci., 2005

A Class of Rational n-WFSM Auto-intersections.
Proceedings of the Implementation and Application of Automata, 2005

WFSM Auto-intersection and Join Algorithms.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004
Derivatives of rational expressions and related theorems.
Theor. Comput. Sci., 2004

NFA reduction algorithms by means of regular inequalities.
Theor. Comput. Sci., 2004

Random Generation Models for NFAs.
Journal of Automata, Languages and Combinatorics, 2004

From Regular Weighted Expressions To Finite Automata.
Int. J. Found. Comput. Sci., 2004

Compact and fast algorithms for safe regular expression search.
Int. J. Comput. Math., 2004

Unavoidable Sets of Constant Length.
IJAC, 2004

Computing the Follow Automaton of an Expression.
Proceedings of the Implementation and Application of Automata, 2004

Brute Force Determinization of NFAs by Means of State Covers.
Proceedings of the Implementation and Application of Automata, 2004

Follow Automaton versus Equation Automaton.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Reducing Cover Subsequential Transducers.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003
Virtual Operations On Virtual Networks: The Priority Union .
Int. J. Found. Comput. Sci., 2003

Theoretical study and implementation of the canonical automaton.
Fundam. Inform., 2003

From Regular Weighted Expressions to Finite Automata.
Proceedings of the Implementation and Application of Automata, 2003

NFA Reduction Algorithms by Means of Regular Inequalities.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

Random DFAs over a Non-Unary Alphabet.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
Canonical derivatives, partial derivatives and finite automaton constructions.
Theor. Comput. Sci., 2002

Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions.
Int. J. Found. Comput. Sci., 2002

Split and join for minimizing: Brzozowski's algorithm.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

NFAs bitstream-based random generation.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
Foreword.
Theor. Comput. Sci., 2001

Subset construction complexity for homogeneous automata, position automata and ZPC-structures.
Theor. Comput. Sci., 2001

From C-Continuations to New Quadratic Algorithms for Automaton Synthesis.
IJAC, 2001

From Mirkin's Prebases to Antimirov's Word Partial Derivatives.
Fundam. Inform., 2001

Brzozowski's Derivatives Extended to Multiplicities.
Proceedings of the Implementation and Application of Automata, 2001

Computing the Equation Automaton of a Regular Expression in Space and Time.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
New Finite Automaton Constructions Based on Canonical Derivatives.
Proceedings of the Implementation and Application of Automata, 2000

Implicit Structures to Implement NFA's from Regular Expressions.
Proceedings of the Implementation and Application of Automata, 2000

1999
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton.
Theor. Comput. Sci., 1999

SEA: A Symbolic Environment for Automata Theory.
Proceedings of the Automata Implementation, 1999

1998
Autographe: A Graphical Version of Automate.
Proceedings of the Automata Implementation, 1998

Automata and Binary Decision Diagrams.
Proceedings of the Automata Implementation, 1998

Determinization of Glushkov Automata.
Proceedings of the Automata Implementation, 1998

1996
A New Quadratic Algorithm to Convert a Regular Expression into an Automaton.
Proceedings of the Automata Implementation, 1996

1992
A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups.
Proceedings of the STACS 92, 1992

1991
AUTOMATE, a Computing Package for Automata and Finite Semigroups.
J. Symb. Comput., 1991

1989
A maxmin problem on finite automata.
Discrete Applied Mathematics, 1989


  Loading...