Jean-Marc Champarnaud

Nadia Ouali Sebti

J. Autom. Lang. Comb., 2017

2016

Constrained Expressions and their Derivatives.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

2015

Extended to multi-tilde-bar regular expressions and efficient finite automata constructions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Bottom Up Quotients and Residuals for Tree Languages.

[BibT_eX]

[DOI]

Nadia Ouali Sebti

CoRR, 2015

2014

A general framework for the derivation of regular expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

2013

Derivatives of Approximate Regular Expressions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

A generic method for the enumeration of various classes of directed polycubes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Enumeration of Specific Classes of Polycubes.

[BibT_eX]

[DOI]

Quentin Cohen-Solal

Electron. J. Comb., 2013

2012

Geometrical regular languages and linear Diophantine equations: The strongly connected case.

[BibT_eX]

[DOI]

Béatrice Bouchou-Markhoff

Theor. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Béatrice Bouchou-Markhoff

Denis Maurel

Theor. Comput. Sci., 2012

Obituary for Sheng Yu.

[BibT_eX]

[DOI]

Denis Maurel

Theor. Comput. Sci., 2012

Multi-tilde-bar expressions and their automata.

[BibT_eX]

[DOI]

Acta Informatica, 2012

Multi-Tilde-Bar Derivatives.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

Approximate Regular Expressions and Their Derivatives.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Decidability of Geometricity of Regular Languages.

[BibT_eX]

[DOI]

Marie-Pierre Béal

Sylvain Lombardy

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].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Multi-Bar and Multi-Tilde Regular Operators.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Reduction Techniques for Acyclic Cover Transducers.

[BibT_eX]

[DOI]

Jacques Farré

Fundam. Informaticae, 2011

Partial Derivatives of an Extended Regular Expression.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Geometrical Regular Languages and Linear Diophantine Equations.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Acyclic automata and small expressions using multi-tilde-bar operators.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Regular Geometrical Languages and Tiling the Plane.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

Geometricity of Binary Regular Languages.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

An Efficient Computation of the Equation K-automaton of a Regular K-expression.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Small Extended Expressions for Acyclic Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2009

A New Family of Regular Operators Fitting with the Position Automaton Computation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Multi-tilde Operators and Their Glushkov Automata.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

2007

Labelling Multi-Tape Automata with Constrained Symbol Classes.

[BibT_eX]

[DOI]

Tibor Csáki

Tamás Gaál

Int. J. Found. Comput. Sci., 2007

Normalized Expressions and Finite Automata.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2007

Reducing Acyclic Cover Transducers.

[BibT_eX]

[DOI]

Jacques Farré

Proceedings of the Implementation and Application of Automata, 2007

Geometrical Languages.

[BibT_eX]

Baptiste Blanpain

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.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

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

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

Multi-tape Automata with Symbol Classes.

[BibT_eX]

[DOI]

Tibor Csáki

Tamás Gaál

Proceedings of the Implementation and Application of Automata, 2006

2005

Random generation of DFAs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Similarity relations and cover automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2005

Cover transducers for functions with finite domain.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Brute force determinization of nfas by means of state covers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Enumerating nondeterministic automata for a given language without constructing the canonical automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

A Class of Rational n-WFSM Auto-intersections.

[BibT_eX]

[DOI]

Jason Eisner

Proceedings of the Implementation and Application of Automata, 2005

WFSM Auto-intersection and Join Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004

Derivatives of rational expressions and related theorems.

[BibT_eX]

[DOI]

Gérard Duchamp

Theor. Comput. Sci., 2004

NFA reduction algorithms by means of regular inequalities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Random Generation Models for NFAs.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

From Regular Weighted Expressions To Finite Automata.

[BibT_eX]

[DOI]

Éric Laugerotte

Int. J. Found. Comput. Sci., 2004

Compact and fast algorithms for safe regular expression search.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2004

Unavoidable Sets of Constant Length.

[BibT_eX]

[DOI]

Dominique Perrin

Int. J. Algebra Comput., 2004

Computing the Follow Automaton of an Expression.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

Follow Automaton versus Equation Automaton.

[BibT_eX]

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

Reducing Cover Subsequential Transducers.

[BibT_eX]

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 .

[BibT_eX]

[DOI]

Lauri Karttunen

Tamás Gaál

Int. J. Found. Comput. Sci., 2003

Theoretical study and implementation of the canonical automaton.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Random DFAs over a Non-Unary Alphabet.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Evaluation of Three Implicit Structures to Implement Nondeterministic Automata From Regular Expressions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Split and join for minimizing: Brzozowski's algorithm.

[BibT_eX]

[DOI]

Ahmed Khorsi

Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

NFAs bitstream-based random generation.

[BibT_eX]

Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001

Foreword.

[BibT_eX]

[DOI]

Denis Maurel

Theor. Comput. Sci., 2001

Subset construction complexity for homogeneous automata, position automata and ZPC-structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

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

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2001

From Mirkin's Prebases to Antimirov's Word Partial Derivatives.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Brzozowski's Derivatives Extended to Multiplicities.

[BibT_eX]

[DOI]

Gérard Duchamp

Proceedings of the Implementation and Application of Automata, 2001

Computing the Equation Automaton of a Regular Expression in Space and Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

New Finite Automaton Constructions Based on Canonical Derivatives.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

Implicit Structures to Implement NFA's from Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

1999

An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

From regular expressions to finite automata.

[BibT_eX]

[DOI]

Jean-Luc Ponty

Int. J. Comput. Math., 1999

SEA: A Symbolic Environment for Automata Theory.

[BibT_eX]

[DOI]

Philippe Andary

Gérard Duchamp

Marianne Flouret

Éric Laugerotte

Proceedings of the Automata Implementation, 1999

1998

Autographe: A Graphical Version of Automate.

[BibT_eX]

[DOI]

Are Uppman

Proceedings of the Automata Implementation, 1998

Automata and Binary Decision Diagrams.

[BibT_eX]

[DOI]

Jean-Francis Michon

Proceedings of the Automata Implementation, 1998

Determinization of Glushkov Automata.

[BibT_eX]

[DOI]

Jean-Luc Ponty

Proceedings of the Automata Implementation, 1998

1996

A New Quadratic Algorithm to Convert a Regular Expression into an Automaton.

[BibT_eX]

[DOI]

Jean-Luc Ponty

Proceedings of the Automata Implementation, 1996

1992

A Programming Language for Symbolic Computation of Regular Languages, Automata and Semigroups.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1991

AUTOMATE, a Computing Package for Automata and Finite Semigroups.

[BibT_eX]

[DOI]

J. Symb. Comput., 1991

1989

A maxmin problem on finite automata.

[BibT_eX]

[DOI]