Pascal Caron

CoRR, 2024

2023

The Exact State Complexity for the Composition of Root and Reversal.

[BibT_eX]

[DOI]

Alexandre Durand

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Operational State Complexity Revisited: The Contribution of Monsters and Modifiers.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

Combination of roots and boolean operations: An application to state complexity.

[BibT_eX]

[DOI]

Inf. Comput., 2022

State complexity of the star of a Boolean operation.

[BibT_eX]

[DOI]

CoRR, 2022

2020

A Combinatorial Approach for the State Complexity of the Shuffle Product.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2020

New tools for state complexity.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

The state complexity of a class of operations involving roots and boolean operations.

[BibT_eX]

[DOI]

CoRR, 2020

A Study of a Simple Class of Modifiers: Product Modifiers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

2019

State complexity of combined operations involving catenation and binary Boolean operations: Beyond the Brzozowski conjectures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

(<i>k</i>,<i>l</i>)-Unambiguity and Quasi-Deterministic Structures.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2019

Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

2018

State Complexity of Multiple Catenations.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

2017

On the hierarchy of generalizations of one-unambiguous regular languages.

[BibT_eX]

[DOI]

Clément Miklarz

Theor. Comput. Sci., 2017

On the decidability of $k$-Block determinism.

[BibT_eX]

[DOI]

Clément Miklarz

CoRR, 2017

State complexity of catenation combined with boolean operations.

[BibT_eX]

[DOI]

CoRR, 2017

2016

State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

State complexity of multiple catenation.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On the Hierarchy of Block Deterministic Languages.

[BibT_eX]

[DOI]

Clément Miklarz

Proceedings of the Implementation and Application of Automata, 2015

2014

A general framework for the derivation of regular expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

(k, l)-Unambiguity and Quasi-Deterministic Structures.

[BibT_eX]

[DOI]

CoRR, 2014

(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization.

[BibT_eX]

[DOI]

Béatrice Bouchou-Markhoff

Proceedings of the Language and Automata Theory and Applications, 2014

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

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

From Glushkov WFAs to K-Expressions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Partial Derivatives of an Extended Regular Expression.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Generalized One-Unambiguity.

[BibT_eX]

[DOI]

Yo-Sub Han

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On Glushkov K-graphs.

[BibT_eX]

Proceedings of the Scientific Applications of Language Methods., 2010

2009

Algorithms for Glushkov K-graphs

[BibT_eX]

[DOI]

CoRR, 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

2003

Glushkov Construction for Series: The Non Commutative Case.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2003

From Glushkov WFAs to Rational Expressions.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Star Normal Form, Rational Expressions, and Glushkov WFAs Properties.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

2000

Characterization of Glushkov automata.

[BibT_eX]

[DOI]

Djelloul Ziadi

Theor. Comput. Sci., 2000

Families of locally testable languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

LANGAGE: A Maple Package for Automaton Characterization of Regular Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Glushkov Construction for Multiplicities.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

1999

SEA: A Symbolic Environment for Automata Theory.

[BibT_eX]

[DOI]

Philippe Andary

Gérard Duchamp

Éric Laugerotte

Proceedings of the Automata Implementation, 1999

1997

AG: A Set of Maple Packages for Manipulating Automata and Semigroups.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1997

AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups.

[BibT_eX]

[DOI]