| Publication | Date of Publication | Type |
|---|
| Bottom-Up derivatives of tree expressions | 2022-01-12 | Paper |
| \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions | 2021-06-22 | Paper |
| The bottom-up position tree automaton and the father automaton | 2021-04-19 | Paper |
| Efficient geometric-based computation of the string subsequence kernel | 2019-05-03 | Paper |
| The bottom-up position tree automaton and its compact version | 2018-11-07 | Paper |
| An efficient algorithm for the construction of the equation tree automaton | 2018-11-01 | Paper |
| From tree automata to string automata minimization | 2018-07-23 | Paper |
| Tree pattern matching from regular tree expressions. | 2018-06-15 | Paper |
| Bottom-up quotients for tree languages | 2018-03-29 | Paper |
| Tree automata constructions from regular expressions: a comparative study | 2018-03-02 | Paper |
| Extended to multi-tilde-bar regular expressions and efficient finite automata constructions | 2015-08-18 | Paper |
| An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations | 2015-02-25 | Paper |
| On the Transition Reduction Problem for Finite Automata | 2014-12-22 | Paper |
| Efficient List-Based Computation of the String Subsequence Kernel | 2014-03-31 | Paper |
| From regular tree expression to position tree automaton | 2013-03-18 | Paper |
| From Regular Weighted Expressions to Finite Automata | 2010-05-07 | Paper |
| An Efficient Computation of the Equation K-automaton of a Regular K-expression | 2009-05-22 | Paper |
| Fast equation automaton computation | 2009-05-13 | Paper |
| Efficient weighted expressions conversion | 2008-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3507586 | 2008-06-20 | Paper |
| An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression | 2007-11-28 | Paper |
| NORMALIZED EXPRESSIONS AND FINITE AUTOMATA | 2007-06-20 | Paper |
| FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON | 2006-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313786 | 2005-09-01 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA | 2005-04-18 | Paper |
| A characterization of Thompson digraphs. | 2004-01-26 | Paper |
| Canonical derivatives, partial derivatives and finite automaton constructions. | 2003-01-21 | Paper |
| FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547747 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540960 | 2002-07-28 | Paper |
| From Mirkin's prebases to Antimirov's word partial derivatives | 2001-04-24 | Paper |
| Characterization of Glushkov automata | 2000-08-23 | Paper |
| Sorting and doubling techniques for set partitioning and automata minimization problems | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955253 | 2000-05-25 | Paper |
| From regular expressions to finite automata∗ | 2000-03-21 | Paper |
| An optimal parallel algorithm to convert a regular expression into its Glushkov automaton | 1999-04-28 | Paper |
| The passing of a rational expression to a nondeterministic finite automaton | 1999-03-14 | Paper |
| Regular expression for a language without empty word | 1997-09-10 | Paper |
