• A full list of publications is available through Daniel Reidenbach's departmental web page.
• An alternative list of publications is provided by the DBLP Bibliography Server.
• Copies of selected papers can be obtained from the author on request.

• Daniel Reidenbach, Markus L. Schmid. Finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access.
  International Journal of Computer Mathematics, accepted for publication.
  [download publisher's version]
• Hossein Nevisi, Daniel Reidenbach. Unambiguous 1-Uniform Morphisms.
  Theoretical Computer Science 478, pages 101-117. 2013.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. Inferring Descriptive Generalisations of Formal Languages.
  Journal of Computer and System Sciences 79, pages 622-639. 2013.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach. Weakly Unambiguous Morphisms.
  Theoretical Computer Science 448, pages 21-40. 2012.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Markus L. Schmid. On Multi-head Automata with Restricted Nondeterminism.
  Information Processing Letters 112, pages 572-577. 2012.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Johannes C. Schneider. Restricted Ambiguity of Erasing Morphisms.
  Theoretical Computer Science 412, pages 3510-3523. 2011.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. Existence and nonexistence of descriptive patterns.
  Theoretical Computer Science 411, pages 3274-3286. 2010.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. Bad News on Decision Problems for Patterns.
  Information and Computation 208, pages 83-96. 2010.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. The unambiguity of segmented morphisms.
  Discrete Applied Mathematics 157, pages 3055-3068. 2009.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Johannes C. Schneider. Morphically primitive words.
  Theoretical Computer Science 410, pages 2148-2161. 2009.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach. Discontinuities in pattern inference.
  Theoretical Computer Science 397, pages 166-193. 2008.
  [download author's final version] [download publisher's version]
• Daniel Reidenbach. An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-pattern Languages.
  Journal of Automata, Languages and Combinatorics 12, pages 407-426. 2007.
• Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider. Unambiguous Morphic Images of Strings.
  International Journal of Foundations of Computer Science 17, pages 601-628. 2006.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach. A non-learnable class of E-pattern languages.
  Theoretical Computer Science 350, pages 91-102. 2006.
  [download author's final version] [download publisher's version]

• Joel D. Day, Daniel Reidenbach, Johannes C. Schneider. On the Dual Post Correspondence Problem.
  In Proc. 17th International Conference on Developments in Language Theory, DLT 2013, to appear.
• Daniel Reidenbach, Markus L. Schmid. Automata with Modulo Counters and Nondeterministic Counter Bounds.
  In Nelma Moreira and Rogerio Reis, editors, Proc. 17th International Conference on Implementation and Application of Automata, CIAA 2012, LNCS 7381, pages 361-368. Springer-Verlag, 2012.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Markus L. Schmid. Regular and Context-Free Pattern Languages Over Small Alphabets.
  In Hsu-Chun Yen and Oscar H. Ibarra, editors, Proc. 16th International Conference on Developments in Language Theory, DLT 2012, LNCS 7410, pages 130-141. Springer-Verlag, 2012.
  [download authors' final version] [download publisher's version]
• Hossein Nevisi, Daniel Reidenbach. Morphic Primitivity and Alphabet Reductions.
  In Hsu-Chun Yen and Oscar H. Ibarra, editors, Proc. 16th International Conference on Developments in Language Theory, DLT 2012, LNCS 7410, pages 440-451. Springer-Verlag, 2012.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Markus L. Schmid. Patterns with Bounded Treewidth.
  In Adrian-Horia Dediu and Carlos Martin-Vide, editors, Proc. 6th International Conference on Language and Automata Theory and Applications, LATA 2012, LNCS 7183, pages 468-479. Springer-Verlag, 2012.
  [download authors' final version] [download publisher's version]
• Hossein Nevisi, Daniel Reidenbach. Unambiguous 1-Uniform Morphisms.
  In Petr Ambroz, Stepan Holub, and Zuzana Masakova, editors, Proc. 8th International Conference on Words, WORDS 2011, EPTCS 63, pages 158-167, 2011.
  [download published version] [alternative URL for published version]
• Daniel Reidenbach, Markus L. Schmid. Finding Shuffle Words that Represent Optimal Scheduling of Shared Memory Access.
  In Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martin-Vide, editors, Proc. 5th International Conference on Language and Automata Theory and Applications, LATA 2011, LNCS 6638, pages 465-476. Springer-Verlag, 2011.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach. Weakly Unambiguous Morphisms.
  In Thomas Schwentick, Christoph Dürr, editors, Proc. 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, pages 213-224. 2011.
  [download published version] [alternative URL for published version]
• Daniel Reidenbach, Markus L. Schmid. A Polynomial Time Match Test for Large Classes of Extended Regular Expressions.
  In Michael Domaratzki, Kai Salomaa, editors, Proc. 15th International Conference on Implementation and Application of Automata, CIAA 2010, LNCS 6482, pages 241-250. Springer-Verlag, 2011.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Johannes C. Schneider. Restricted Ambiguity of Erasing Morphisms.
  In Yuan Gao, Hanlin Lu, Shinnosuke Seki, and Sheng Yu, editors, Proc. 14th International Conference on Developments in Language Theory, DLT 2010, LNCS 6224, pages 387-398. Springer-Verlag, 2010.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. Inferring Descriptive Generalisations of Formal Languages.
  In Adam Kalai and Mehryar Mohri, editors, Proc. 23rd Annual Conference on Learning Theory, COLT 2010, pages 194-206. ACL/Omnipress, 2010.
  [download published version]
• Dominik D. Freydenberger, Daniel Reidenbach. Existence and Nonexistence of Descriptive Patterns.
  In Volker Diekert and Dirk Nowotka, editors, Proc. 13th International Conference on Developments in Language Theory, DLT 2009, LNCS 5583, pages 228-239. Springer-Verlag, 2009.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach. Bad News on Decision Problems for Patterns.
  In Masami Ito and Masafumi Toyama, editors, Proc. 12th International Conference on Developments in Language Theory, DLT 2008, LNCS 5257, pages 327-338. Springer-Verlag, 2008.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach, Johannes C. Schneider. Morphically Primitive Words.
  In Pierre Arnoux, Nicolas Bédaride, and Julien Cassaigne, editors, Proc. 6th International Conference on Words, WORDS 2007, pages 262-272. 2007.
  [download authors' final version]
• Dominik D. Freydenberger, Daniel Reidenbach. The Unambiguity of Segmented Morphisms.
  In Tero Harju, Juhani Karhumäki, Arto Lepistö, editors, Proc. 11th International Conference on Developments in Language Theory, DLT 2007, LNCS 4588, pages 181-192. Springer-Verlag, 2007.
  [download authors' final version] [download publisher's version]
• Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider. Unambiguous Morphic Images of Strings.
  In Clelia De Felice and Antonio Restivo, editors, Proc. 9th International Conference on Developments in Language Theory, DLT 2005, LNCS 3572, pages 248-259. Springer-Verlag, 2005.
  [download authors' final version] [download publisher's version]
• Daniel Reidenbach. On the Equivalence Problem for E-pattern Languages over Small Alphabets.
  In Cristian S. Calude, Elena Calude, and Michael J. Dinneen, editors, Proc. 8th International Conference on Developments in Language Theory, DLT 2004, LNCS 3340, pages 368-380. Springer-Verlag, 2004.
  [download author's final version] [download publisher's version]
• Daniel Reidenbach. On the Learnability of E-pattern Languages over Small Alphabets.
  In John Shawe-Taylor and Yoram Singer, editors, Proc. 17th Conference on Learning Theory, COLT 2004, LNAI 3120, pages 140-154. Springer-Verlag, 2004.
  [download author's final version] [download publisher's version]
• Daniel Reidenbach. A Discontinuity in Pattern Inference.
  In Volker Diekert and Michel Habib, editors, Proc. 21st International Symposium on Theoretical Aspects of Computer Science, STACS 2004, LNCS 2996, pages 129-140. Springer-Verlag, 2004.
  [download author's final version] [download publisher's version]
• Daniel Reidenbach. A Negative Result on Inductive Inference of Extended Pattern Languages.
  In Nicolò Cesa-Bianchi, Masayuki Numao, and Rüdiger Reischuk, editors, Proc. 13th International Conference on Algorithmic Learning Theory, ALT 2002, LNAI 2533, pages 308-320. Springer-Verlag, 2002.
  [download author's final version] [download publisher's version]

• Daniel Reidenbach, Markus L. Schmid. Automata for Languages Defined by Backreferencing.
  In Jürgen Dassow, Bianca Truthe, editors, Proc. 21. Theorietag der GI Fachgruppe AFS, Automaten und Formale Sprachen, pages 101-104. Otto-von-Guericke-Universität Magdeburg, 2011.
  [download workshop proceedings]
• Daniel Reidenbach, Markus L. Schmid. Common Supersequences with Minimum Scope Coincidence Degree.
  In Friedrich Otto, Norbert Hundeshagen, and Marcel Vollweiler, editors, Proc. 20. Theorietag der GI Fachgruppe AFS, Automaten und Formale Sprachen, pages 115-120. Kasseler Informatikschriften 2010, 3. 2010.
  [download workshop proceedings]
• Dominik D. Freydenberger, Daniel Reidenbach. E-deskriptive Pattern für unendliche Sprachen (in German).
  In Jöran Mielke, Ludwig Staiger, and Renate Winter, editors, Proc. 19. Theorietag der GI Fachgruppe 0.1.5, Automaten und Formale Sprachen, pages 24-25. Technical Report 2009/03, Institute of Computer Science, University Halle-Wittenberg, 2009.
  [download workshop proceedings]
• Dominik D. Freydenberger, Daniel Reidenbach. Inklusionsprobleme für Patternsprachen (in German).
  In Markus Holzer, Martin Kutrib, and Andreas Malcher, editors, Proc. 18. Theorietag der GI Fachgruppe 0.1.5, Automaten und Formale Sprachen, pages 55-60. Institut für Informatik, Universität Gießen, 2008.
  [download workshop proceedings]
• Daniel Reidenbach. Die Mehrdeutigkeit von Homomorphismen in freien Monoiden und ihr Einfluß auf algorithmische Eigenschaften von Patternsprachen (in German).
  In Dorothea Wagnet et al., editor, Ausgezeichnete Informatikdissertationen 2006, Lecture Notes in Informatics D-7, pages 159-168. Gesellschaft für Informatik, 2007.
• Daniel Reidenbach, Johannes C. Schneider. Ein alternativer Primitivitätsbegriff für Wörter (in German).
  In Manfred Droste and Markus Lohrey, editors, Proc. 17. Theorietag der GI Fachgruppe 0.1.5, Automaten und Formale Sprachen, pages 116-120. 2007.
  [download workshop proceedings]
• The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages.
  Doctoral thesis, Department of Computer Science, University of Kaiserslautern. Logos Verlag, Berlin, 2006. ISBN 978-3-8325-1449-5.
  [abstract] [publisher's web page]
• Daniel Reidenbach. Inductive Inference of E-pattern Languages: A Progress Report.
  In Henning Fernau, editor, Proc. Workshop on Theoretical Aspects of Grammar Induction, TAGI, WSI-2005-14, pages 30-33. Technical Report, Universität Tübingen, 2005.
• Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider. Eindeutige Homomorphismen in freien Monoiden (in German).
  In Henning Fernau, editor, Proc. 15. Theorietag der GI Fachgruppe 0.1.5, Automaten und Formale Sprachen, WSI-2005-16, pages 18-21. Technical Report, Universität Tübingen, 2005.

Last update: April 10, 2013