Ludovic Mignot
According to our database1,
Ludovic Mignot
authored at least 30 papers
between 2009 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
-
at orcid.org
On csauthors.net:
Bibliography
2019
(k,l)-Unambiguity and Quasi-Deterministic Structures.
Journal of Automata, Languages and Combinatorics, 2019
Extended tree expressions and their derivatives.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019
Geometrical Closure of Binary V_3/2 Languages.
Proceedings of the Language and Automata Theory and Applications, 2019
2018
An Efficient Algorithm for the Construction of the Equation Tree Automaton.
Int. J. Found. Comput. Sci., 2018
The Bottom-Up Position Tree Automaton and Its Compact Version.
Proceedings of the Implementation and Application of Automata, 2018
2017
On the hierarchy of generalizations of one-unambiguous regular languages.
Theor. Comput. Sci., 2017
Bottom-Up Quotients for Tree Languages.
Journal of Automata, Languages and Combinatorics, 2017
Tree Automata Constructions from Regular Expressions: a Comparative Study.
Fundam. Inform., 2017
2016
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach.
Int. J. Found. Comput. Sci., 2016
Constrained Expressions and their Derivatives.
Fundam. Inform., 2016
2015
On the Hierarchy of Block Deterministic Languages.
Proceedings of the Implementation and Application of Automata, 2015
2014
A general framework for the derivation of regular expressions.
RAIRO - Theor. Inf. and Applic., 2014
$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014
(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization.
Proceedings of the Language and Automata Theory and Applications, 2014
An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014
2013
Some Combinatorial Operators in Language Theory.
Journal of Automata, Languages and Combinatorics, 2013
Derivatives of Approximate Regular Expressions.
Discrete Mathematics & Theoretical Computer Science, 2013
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.
Proceedings of the Language and Automata Theory and Applications, 2013
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
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
Partial Derivatives of an Extended Regular Expression.
Proceedings of the Language and Automata Theory and Applications, 2011
Generalized One-Unambiguity.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
2010
Des Codes Barres pour les Langages Rationnels. (Bar Codes for Regular Languages).
PhD thesis, 2010
Acyclic automata and small expressions using multi-tilde-bar operators.
Theor. Comput. Sci., 2010
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