A Workflow Component for Knowledge Management in the Field of Radiological Examinations. - Dirk Krechel; Kerstin Faber; Daniel Reidenbach; Klaus Blasinger; Aldo von Wangenheim; Eros Comunello (Bildverarbeitung für die Medizin, 2000)

Modelling of Radiological Examinations with POKMAT, a Process Oriented Knowledge Management Tool. - Kerstin Faber; Dirk Krechel; Daniel Reidenbach; Aldo von Wangenheim; Paulo Roberto Wille (AIME, 2001)

Process Oriented Knowledge Management for Radiological Examinations. - Dirk Krechel; Kerstin Maximini; Daniel Reidenbach; Aldo von Wangenheim (CBMS, 2001)

A Negative Result on Inductive Inference of Extended Pattern Languages. - Daniel Reidenbach (ALT, 2002)

On the Learnability of E-pattern Languages over Small Alphabets. - Daniel Reidenbach (COLT, 2004)

On the Equivalence Problem for E-pattern Languages over Small Alphabets. - Daniel Reidenbach (Developments in Language Theory, 2004)

A Discontinuity in Pattern Inference. - Daniel Reidenbach (STACS, 2004)

The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages. - Daniel Reidenbach (Logos-Verlag, 2006)

The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages. - Daniel Reidenbach (Ausgezeichnete Informatikdissertationen, 2006)

Unambiguous Morphic Images of Strings. - Dominik D. Freydenberger; Daniel Reidenbach; Johannes C. Schneider (Int. J. Found. Comput. Sci., 2006)

A non-learnable class of E-pattern languages. - Daniel Reidenbach (Theor. Comput. Sci., 2006)

An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. - Daniel Reidenbach (J. Autom. Lang. Comb., 2007)

Discontinuities in pattern inference. - Daniel Reidenbach (Theor. Comput. Sci., 2008)

The unambiguity of segmented morphisms. - Dominik D. Freydenberger; Daniel Reidenbach (Discret. Appl. Math., 2009)

Morphically primitive words. - Daniel Reidenbach; Johannes C. Schneider (Theor. Comput. Sci., 2009)

A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. - Daniel Reidenbach; Markus L. Schmid (CIAA, 2010)

Bad news on decision problems for patterns. - Dominik D. Freydenberger; Daniel Reidenbach (Inf. Comput., 2010)

Existence and nonexistence of descriptive patterns. - Dominik D. Freydenberger; Daniel Reidenbach (Theor. Comput. Sci., 2010)

Restricted ambiguity of erasing morphisms. - Daniel Reidenbach; Johannes C. Schneider (Theor. Comput. Sci., 2011)

Morphic Primitivity and Alphabet Reductions. - Hossein Nevisi; Daniel Reidenbach (Developments in Language Theory, 2012)

On multi-head automata with restricted nondeterminism. - Daniel Reidenbach; Markus L. Schmid (Inf. Process. Lett., 2012)

Weakly unambiguous morphisms. - Dominik D. Freydenberger; Hossein Nevisi; Daniel Reidenbach (Theor. Comput. Sci., 2012)

Finding shuffle words that represent optimal scheduling of shared memory access. - Daniel Reidenbach; Markus L. Schmid (Int. J. Comput. Math., 2013)

Inferring descriptive generalisations of formal languages. - Dominik D. Freydenberger; Daniel Reidenbach (J. Comput. Syst. Sci., 2013)

Unambiguous 1-uniform morphisms. - Hossein Nevisi; Daniel Reidenbach (Theor. Comput. Sci., 2013)

Report on BCTCS 2014. - Paul Bell; Daniel Reidenbach (Bull. EATCS, 2014)

Patterns with bounded treewidth. - Daniel Reidenbach; Markus L. Schmid (Inf. Comput., 2014)

On the Dual Post Correspondence Problem. - Joel D. Day; Daniel Reidenbach; Johannes C. Schneider (Int. J. Found. Comput. Sci., 2014)

Automata with modulo counters and nondeterministic counter bounds. - Daniel Reidenbach; Markus L. Schmid (Kybernetika, 2014)

Regular and context-free pattern languages over small alphabets. - Daniel Reidenbach; Markus L. Schmid (Theor. Comput. Sci., 2014)

Ambiguity of Morphisms in a Free Group. - Joel D. Day; Daniel Reidenbach (WORDS, 2015)

Factorization in Formal Languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (DLT, 2015)

Periodicity forcing words. - Joel D. Day; Daniel Reidenbach; Johannes C. Schneider (Theor. Comput. Sci., 2015)

Closure properties of pattern languages. - Joel D. Day; Daniel Reidenbach; Markus L. Schmid (J. Comput. Syst. Sci., 2017)

On the Prefix-Suffix Duplication Reduction. - Szilárd Zsolt Fazekas; Robert Mercas; Daniel Reidenbach (Int. J. Found. Comput. Sci., 2020)

Unique decipherability in formal languages. - Paul C. Bell; Daniel Reidenbach; Jeffrey O. Shallit (Theor. Comput. Sci., 2020)

Reducing the ambiguity of Parikh matrices. - Jeffery Dick; Laura K. Hutchinson; Robert Mercas; Daniel Reidenbach (Theor. Comput. Sci., 2021)

The Billaud Conjecture for ${|{ varSigma } |} = 4$, and Beyond. - Szymon Lopaciuk; Daniel Reidenbach (DLT, 2022)

A Toolkit for Parikh Matrices. - Laura K. Hutchinson; Robert Mercas; Daniel Reidenbach (CIAA, 2022)

Unambiguous injective morphisms in free groups. - Joel D. Day; Daniel Reidenbach (Inf. Comput., 2022)

On Billaud words and their companions. - Szymon Lopaciuk; Daniel Reidenbach (Theor. Comput. Sci., 2023)