Jean-Marc Champarnaud

From MaRDI portal
Person:396949

Available identifiers

zbMath Open champarnaud.jean-marcMaRDI QIDQ396949

List of research outcomes





PublicationDate of PublicationType
Bottom-Up Quotients for Tree Languages2018-03-29Paper
Constrained Expressions and their Derivatives2017-11-09Paper
Multi-bar and multi-tilde regular operators2016-09-29Paper
Two-sided derivatives for regular expressions and for hairpin expressions2016-05-11Paper
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions2015-08-18Paper
Enumeration of specific classes of polycubes2014-08-14Paper
A general framework for the derivation of regular expressions2014-08-08Paper
https://portal.mardi4nfdi.de/entity/Q57473812014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q57473912014-02-14Paper
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions2013-03-18Paper
Decidability of Geometricity of Regular Languages2012-11-02Paper
Multi-tilde-bar expressions and their automata2012-10-15Paper
Multi-Tilde-Bar Derivatives2012-09-20Paper
Obituary for Sheng Yu2012-09-13Paper
Geometrical regular languages and linear Diophantine equations: the strongly connected case2012-08-13Paper
Approximate Regular Expressions and Their Derivatives2012-06-08Paper
https://portal.mardi4nfdi.de/entity/Q32257062012-03-22Paper
Geometrical Regular Languages and Linear Diophantine Equations2011-07-29Paper
Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]2011-07-14Paper
Partial Derivatives of an Extended Regular Expression2011-06-03Paper
Regular Geometrical Languages and Tiling the Plane2011-02-11Paper
Acyclic automata and small expressions using multi-tilde-bar operators2010-10-07Paper
Geometricity of Binary Regular Languages2010-05-26Paper
From Regular Weighted Expressions to Finite Automata2010-05-07Paper
AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL2009-08-21Paper
Small Extended Expressions for Acyclic Automata2009-07-09Paper
An Efficient Computation of the Equation K-automaton of a Regular K-expression2009-05-22Paper
Multi-tilde Operators and Their Glushkov Automata2009-04-02Paper
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)2009-02-12Paper
A New Family of Regular Operators Fitting with the Position Automaton Computation2009-02-03Paper
ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES2008-09-25Paper
Reducing Acyclic Cover Transducers2008-06-10Paper
LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES2008-05-20Paper
An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression2007-11-28Paper
Multi-tape Automata with Symbol Classes2007-09-06Paper
NORMALIZED EXPRESSIONS AND FINITE AUTOMATA2007-06-20Paper
Implementation and Application of Automata2006-11-13Paper
FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON2006-05-29Paper
ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON2005-12-15Paper
COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN2005-11-14Paper
VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION2005-10-19Paper
UNAVOIDABLE SETS OF CONSTANT LENGTH2005-09-27Paper
https://portal.mardi4nfdi.de/entity/Q53137862005-09-01Paper
Implementation and Application of Automata2005-08-17Paper
Implementation and Application of Automata2005-08-17Paper
BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS2005-08-01Paper
EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS2005-06-22Paper
Unavoidable sets and conjugacy classes2005-06-09Paper
Similarity relations and cover automata2005-06-07Paper
FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA2005-04-18Paper
Random generation of DFAs2005-02-22Paper
NFA reduction algorithms by means of regular inequalities2005-01-11Paper
Compact and fast algorithms for safe regular expression search2004-12-29Paper
https://portal.mardi4nfdi.de/entity/Q44741442004-08-04Paper
Derivatives of rational expressions and related theorems.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44548422004-03-08Paper
https://portal.mardi4nfdi.de/entity/Q44520622004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44125682003-07-15Paper
Canonical derivatives, partial derivatives and finite automaton constructions.2003-01-21Paper
FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS2002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q45477472002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45409602002-07-28Paper
https://portal.mardi4nfdi.de/entity/Q45409592002-07-28Paper
Subset construction complexity for homogeneous automata, position automata and ZPC-structures2002-03-03Paper
From Mirkin's prebases to Antimirov's word partial derivatives2001-04-24Paper
https://portal.mardi4nfdi.de/entity/Q49552532000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49552602000-05-25Paper
From regular expressions to finite automata2000-03-21Paper
An optimal parallel algorithm to convert a regular expression into its Glushkov automaton1999-04-28Paper
The passing of a rational expression to a nondeterministic finite automaton1999-03-14Paper
AUTOMATE, a computing package for automata and finite semigroups1992-06-28Paper
A maxmin problem on finite automata1989-01-01Paper

Research outcomes over time

This page was built for person: Jean-Marc Champarnaud