The following pages link to Ludovic Mignot (Q256331):
Displaying 34 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators'' [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435] (Q551211) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- The bottom-up position tree automaton and its compact version (Q1616956) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Geometrical closure of binary \(V_{3/2}\) languages (Q2278285) (← links)
- On the hierarchy of generalizations of one-unambiguous regular languages (Q2357109) (← links)
- Two-sided derivatives for regular expressions and for hairpin expressions (Q2805438) (← links)
- Multi-bar and multi-tilde regular operators (Q2819396) (← links)
- A general framework for the derivation of regular expressions (Q2874638) (← links)
- Approximate Regular Expressions and Their Derivatives (Q2890190) (← links)
- Multi-Tilde-Bar Derivatives (Q2914721) (← links)
- On the Hierarchy of Block Deterministic Languages (Q2947409) (← links)
- Partial Derivatives of an Extended Regular Expression (Q3004578) (← links)
- A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- Constrained Expressions and their Derivatives (Q4589251) (← links)
- Tree Automata Constructions from Regular Expressions: a Comparative Study (Q4606264) (← links)
- Bottom-Up Quotients for Tree Languages (Q4609172) (← links)
- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (Q4910458) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- (Q4994954) (← links)
- Bottom-Up derivatives of tree expressions (Q5021108) (← links)
- Multilinear representations of free pros (Q5132617) (← links)
- An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations (Q5175903) (← links)
- Generalized One-Unambiguity (Q5199959) (← links)
- (Q5235981) (← links)
- State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach (Q5298308) (← links)
- (k,l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization (Q5404917) (← links)
- Some Combinatorial Operators in Language Theory (Q5507096) (← links)
- (Q5747391) (← links)
- The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
- Monadic Expressions and Their Derivatives (Q6129080) (← links)
