Ludovic Mignot

Faissal Ouardi

CoRR, 2023

Monadic Expressions and their Derivatives [extended version].

[BibT_eX]

[DOI]

CoRR, 2023

Constrained Multi-Tildes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2023

2022

Monadic Expressions and their Derivatives.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

2021

Bottom-Up derivatives of tree expressions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2021

2020

The Bottom-Up Position Tree Automaton and the Father Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

A unified implementation of automata and expression structures, and of the associated algorithms using enriched categories.

[BibT_eX]

[DOI]

CoRR, 2020

2019

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

[BibT_eX]

[DOI]

Marianne Flouret

J. Autom. Lang. Comb., 2019

Extended tree expressions and their derivatives.

[BibT_eX]

Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

Geometrical Closure of Binary V_3/2 Languages.

[BibT_eX]

[DOI]

Jean-Philippe Dubernard

Giovanna Guaiana

Proceedings of the Language and Automata Theory and Applications, 2019

2018

An Efficient Algorithm for the Construction of the Equation Tree Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions.

[BibT_eX]

[DOI]

CoRR, 2018

The Bottom-Up Position Tree Automaton and Its Compact Version.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

2017

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

[BibT_eX]

[DOI]

Clément Miklarz

Theor. Comput. Sci., 2017

Bottom-Up Quotients for Tree Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Tree Automata Constructions from Regular Expressions: a Comparative Study.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

On the decidability of $k$-Block determinism.

[BibT_eX]

[DOI]

Clément Miklarz

CoRR, 2017

2016

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

[BibT_eX]

[DOI]

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

Constrained Expressions and their Derivatives.

[BibT_eX]

[DOI]

Florent Nicart

Fundam. Informaticae, 2016

Operads, quasiorders, and regular languages.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

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

[BibT_eX]

[DOI]

Jean-Philippe Dubernard

Hadrien Jeanne

Fundam. Informaticae, 2015

Root-Weighted Tree Automata and their Applications to Tree Kernels.

[BibT_eX]

[DOI]

CoRR, 2015

Construction of rational expression from tree automata using a generalization of Arden's Lemma.

[BibT_eX]

[DOI]

CoRR, 2015

Bottom Up Quotients and Residuals for Tree Languages.

[BibT_eX]

[DOI]

CoRR, 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$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

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

[BibT_eX]

[DOI]

Marianne Flouret

CoRR, 2014

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

[BibT_eX]

[DOI]

Marianne Flouret

Proceedings of the Language and Automata Theory and Applications, 2014

An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013

Some Combinatorial Operators in Language Theory.

[BibT_eX]

[DOI]

Jean-Gabriel Luque

Florent Nicart

J. Autom. Lang. Comb., 2013

Derivatives of Approximate Regular Expressions.

[BibT_eX]

[DOI]

Hadrien Jeanne

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

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]

Hadrien Jeanne

Proceedings of the Language and Automata Theory and Applications, 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

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

Des Codes Barres pour les Langages Rationnels. (Bar Codes for Regular Languages).

[BibT_eX]

[DOI]

PhD thesis, 2010

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

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]