13 citations · 25 across the 19 of their papers we have counts for
5 papers · 1 filter
Constrained Expressions and their Derivatives
Jean-Marc Champarnaud, Ludovic Mignot, Florent Nicart
This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These exp…
(k,l)-Unambiguity and Quasi-Deterministic Structures
Pascal Caron, Marianne Flouret, Ludovic Mignot
We focus on the family of -unambiguous automata that encompasses the one of deterministic -lookahead automata introduced by Han and Wood. We show that this family present…
K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions
Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov…
An Efficient Algorithm for the Equation Tree Automaton via the -C-Continuations
Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi
Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression via the -C-Continuations. Kuske and Meinecke extend the comput…
Operads, quasiorders, and regular languages
Samuele Giraudo, Jean-Gabriel Luque, Ludovic Mignot +1
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action…