| Discontinuities in pattern inference D Reidenbach Theoretical Computer Science 397 (1-3), 166-193, 2008 | 56 | 2008 |
| A non-learnable class of E-pattern languages D Reidenbach Theoretical Computer Science 350 (1), 91-102, 2006 | 55 | 2006 |
| Bad news on decision problems for patterns DD Freydenberger, D Reidenbach Information and Computation 208 (1), 83-96, 2010 | 42 | 2010 |
| Patterns with bounded treewidth D Reidenbach, ML Schmid Information and Computation 239, 87-99, 2014 | 37 | 2014 |
| Unambiguous morphic images of strings DD Freydenberger, D Reidenbach, JC Schneider International Journal of Foundations of Computer Science 17 (03), 601-628, 2006 | 36 | 2006 |
| A negative result on inductive inference of extended pattern languages D Reidenbach International Conference on Algorithmic Learning Theory, 308-320, 2002 | 32 | 2002 |
| Morphically primitive words D Reidenbach, JC Schneider Theoretical Computer Science 410 (21-23), 2148-2161, 2009 | 29 | 2009 |
| Inferring descriptive generalisations of formal languages DD Freydenberger, D Reidenbach Journal of Computer and System Sciences 79 (5), 622-639, 2013 | 25 | 2013 |
| A polynomial time match test for large classes of extended regular expressions D Reidenbach, ML Schmid Implementation and Application of Automata: 15th International Conference …, 2011 | 25 | 2011 |
| The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages D Reidenbach Ausgezeichnete Informatikdissertationen 2006, 159-168, 2007 | 17 | 2007 |
| On the learnability of E-pattern languages over small alphabets D Reidenbach International Conference on Computational Learning Theory, 140-154, 2004 | 16 | 2004 |
| An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages D Reidenbach Journal of Automata, Languages and Combinatorics 12 (3), 407-426, 2007 | 15 | 2007 |
| Existence and nonexistence of descriptive patterns DD Freydenberger, D Reidenbach Theoretical Computer Science 411 (34-36), 3274-3286, 2010 | 14 | 2010 |
| Restricted ambiguity of erasing morphisms D Reidenbach, JC Schneider Theoretical Computer Science 412 (29), 3510-3523, 2011 | 13 | 2011 |
| A discontinuity in pattern inference D Reidenbach Annual Symposium on Theoretical Aspects of Computer Science, 129-140, 2004 | 12 | 2004 |
| Regular and context-free pattern languages over small alphabets D Reidenbach, ML Schmid Theoretical Computer Science 518, 80-95, 2014 | 10 | 2014 |
| Weakly unambiguous morphisms DD Freydenberger, H Nevisi, D Reidenbach Theoretical Computer Science 448, 21-40, 2012 | 10 | 2012 |
| Patterns with bounded treewidth D Reidenbach, ML Schmid Language and Automata Theory and Applications: 6th International Conference …, 2012 | 7 | 2012 |
| The unambiguity of segmented morphisms DD Freydenberger, D Reidenbach Discrete Applied Mathematics 157 (14), 3055-3068, 2009 | 7 | 2009 |
| Reducing the ambiguity of Parikh matrices J Dick, LK Hutchinson, R Mercaş, D Reidenbach Theoretical Computer Science 860, 23-40, 2021 | 6 | 2021 |
