Daniel Reidenbach
Daniel Reidenbach
Dept of Computer Science, Loughborough University, UK
Verified email at lboro.ac.uk - Homepage
Title
Cited by
Cited by
Year
A non-learnable class of E-pattern languages
D Reidenbach
Theoretical Computer Science 350 (1), 91-102, 2006
522006
Discontinuities in pattern inference
D Reidenbach
Theoretical Computer Science 397 (1-3), 166-193, 2008
482008
Covering graphs with few complete bipartite subgraphs
H Fleischner, E Mujuni, D Paulusma, S Szeider
Theoretical Computer Science 410 (21-23), 2045-2053, 2009
462009
Bad news on decision problems for patterns
DD Freydenberger, D Reidenbach
Information and Computation 208 (1), 83-96, 2010
332010
Unambiguous morphic images of strings
DD Freydenberger, D Reidenbach, JC Schneider
International Journal of Foundations of Computer Science 17 (03), 601-628, 2006
302006
A negative result on inductive inference of extended pattern languages
D Reidenbach
International Conference on Algorithmic Learning Theory, 308-320, 2002
292002
Patterns with bounded treewidth
D Reidenbach, ML Schmid
Information and Computation 239, 87-99, 2014
262014
A polynomial time match test for large classes of extended regular expressions
D Reidenbach, ML Schmid
International Conference on Implementation and Application of Automata, 241-250, 2010
222010
Morphically primitive words
D Reidenbach, JC Schneider
Theoretical Computer Science 410 (21-23), 2148-2161, 2009
222009
Inferring descriptive generalisations of formal languages
DD Freydenberger, D Reidenbach
Journal of Computer and System Sciences 79 (5), 622-639, 2013
172013
The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages
D Reidenbach
Ausgezeichnete Informatikdissertationen 2006, 2007
152007
On the learnability of E-pattern languages over small alphabets
D Reidenbach
International Conference on Computational Learning Theory, 140-154, 2004
152004
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
132007
A discontinuity in pattern inference
D Reidenbach
Annual Symposium on Theoretical Aspects of Computer Science, 129-140, 2004
132004
Regular and context-free pattern languages over small alphabets
D Reidenbach, ML Schmid
Theoretical Computer Science 518, 80-95, 2014
112014
Existence and nonexistence of descriptive patterns
DD Freydenberger, D Reidenbach
Theoretical Computer Science 411 (34-36), 3274-3286, 2010
72010
Weakly unambiguous morphisms
DD Freydenberger, H Nevisi, D Reidenbach
Theoretical Computer Science 448, 21-40, 2012
62012
Patterns with bounded treewidth
D Reidenbach, ML Schmid
International Conference on Language and Automata Theory and Applications …, 2012
62012
Restricted ambiguity of erasing morphisms
D Reidenbach, JC Schneider
Theoretical Computer Science 412 (29), 3510-3523, 2011
62011
The unambiguity of segmented morphisms
DD Freydenberger, D Reidenbach
Discrete Applied Mathematics 157 (14), 3055-3068, 2009
62009
The system can't perform the operation now. Try again later.
Articles 1–20