The following pages link to Djelloul Ziadi (Q491615):
Displaying 40 items.
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions (Q491616) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Fast equation automaton computation (Q1018095) (← links)
- The passing of a rational expression to a nondeterministic finite automaton (Q1280234) (← links)
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton (Q1285572) (← links)
- Regular expression for a language without empty word (Q1365943) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- (Q1575898) (redirect page) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)
- Characterization of Glushkov automata (Q1575946) (← links)
- The bottom-up position tree automaton and its compact version (Q1616956) (← links)
- Efficient geometric-based computation of the string subsequence kernel (Q1741246) (← links)
- Canonical derivatives, partial derivatives and finite automaton constructions. (Q1853522) (← links)
- (Q2711324) (← links)
- On the Transition Reduction Problem for Finite Automata (Q2934875) (← links)
- (Q3507586) (← links)
- Efficient weighted expressions conversion (Q3515463) (← links)
- From Regular Weighted Expressions to Finite Automata (Q3559799) (← links)
- An Efficient Computation of the Equation K-automaton of a Regular K-expression (Q3625770) (← links)
- (Q4540960) (← links)
- (Q4547747) (← links)
- Tree pattern matching from regular tree expressions (Q4568263) (← links)
- Tree Automata Constructions from Regular Expressions: a Comparative Study (Q4606264) (← links)
- Bottom-Up Quotients for Tree Languages (Q4609172) (← links)
- FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA (Q4667917) (← links)
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS (Q4786303) (← links)
- From Regular Tree Expression to Position Tree Automaton (Q4910478) (← links)
- From regular expressions to finite automata<sup>∗</sup> (Q4944659) (← links)
- (Q4955253) (← links)
- An Efficient Algorithm for the Construction of the Equation Tree Automaton (Q4963261) (← links)
- (Q4994954) (← links)
- Bottom-Up derivatives of tree expressions (Q5021108) (← links)
- An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations (Q5175903) (← links)
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA (Q5292270) (← links)
- (Q5313786) (← links)
- Efficient List-Based Computation of the String Subsequence Kernel (Q5404907) (← links)
- An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression (Q5428227) (← links)
- Implementation and Application of Automata (Q5464012) (← links)
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON (Q5470157) (← links)
- The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
