Daniel Reidenbach

ORCID

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 15

Top Venues

Theor. Comput. Sci.

WORDS

J. Comput. Syst. Sci.

Developments in Language Theory

Kaiserslautern University of Technology, Germany (PHD)

Education History

Kaiserslautern University of Technology, Germany

PHD

Publications

Szymon Lopaciuk, Daniel Reidenbach
On Billaud words and their companions. Theor. Comput. Sci. 940 (Part) (2023)
Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
A Toolkit for Parikh Matrices. CIAA (2022)
Szymon Lopaciuk, Daniel Reidenbach
The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond. DLT (2022)
Joel D. Day, Daniel Reidenbach
Unambiguous injective morphisms in free groups. Inf. Comput. 289 (Part) (2022)
Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
Reducing the ambiguity of Parikh matrices. Theor. Comput. Sci. 860 (2021)
Szymon Lopaciuk, Daniel Reidenbach
On Billaud Words and Their Companions. WORDS (2021)
Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31 (1) (2020)
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Unique decipherability in formal languages. Theor. Comput. Sci. 804 (2020)
Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach
Reducing the Ambiguity of Parikh Matrices. LATA (2020)
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
Closure properties of pattern languages. J. Comput. Syst. Sci. 84 (2017)
Daniel Reidenbach, Markus L. Schmid
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CoRR (2017)
Joel D. Day, Daniel Reidenbach
Ambiguity of Morphisms in a Free Group. WORDS (2015)
Paul Bell, Daniel Reidenbach, Jeffrey O. Shallit
Factorization in Formal Languages. CoRR (2015)
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Factorization in Formal Languages. DLT (2015)
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
Periodicity forcing words. Theor. Comput. Sci. 601 (2015)
Paul Bell, Daniel Reidenbach
Report on BCTCS 2014. Bull. EATCS 113 (2014)
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
Closure Properties of Pattern Languages. Developments in Language Theory (2014)
Daniel Reidenbach, Markus L. Schmid
Regular and context-free pattern languages over small alphabets. Theor. Comput. Sci. 518 (2014)
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
On the Dual Post Correspondence Problem. Int. J. Found. Comput. Sci. 25 (8) (2014)
Daniel Reidenbach, Markus L. Schmid
Automata with modulo counters and nondeterministic counter bounds. Kybernetika 50 (1) (2014)
Daniel Reidenbach, Markus L. Schmid
Patterns with bounded treewidth. Inf. Comput. 239 (2014)
Daniel Reidenbach, Markus L. Schmid
Finding shuffle words that represent optimal scheduling of shared memory access. Int. J. Comput. Math. 90 (6) (2013)
Hossein Nevisi, Daniel Reidenbach
Unambiguous 1-uniform morphisms. Theor. Comput. Sci. 478 (2013)
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
On the Dual Post Correspondence Problem. Developments in Language Theory (2013)
Joel D. Day, Daniel Reidenbach, Johannes C. Schneider
Periodicity Forcing Words. WORDS (2013)
Dominik D. Freydenberger, Daniel Reidenbach
Inferring descriptive generalisations of formal languages. J. Comput. Syst. Sci. 79 (5) (2013)
Daniel Reidenbach, Markus L. Schmid
Automata with Modulo Counters and Nondeterministic Counter Bounds. CIAA (2012)
Daniel Reidenbach, Markus L. Schmid
Patterns with Bounded Treewidth. LATA (2012)
Hossein Nevisi, Daniel Reidenbach
Morphic Primitivity and Alphabet Reductions. Developments in Language Theory (2012)
Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach
Weakly unambiguous morphisms. Theor. Comput. Sci. 448 (2012)
Daniel Reidenbach, Markus L. Schmid
Regular and Context-Free Pattern Languages over Small Alphabets. Developments in Language Theory (2012)
Daniel Reidenbach, Markus L. Schmid
On multi-head automata with restricted nondeterminism. Inf. Process. Lett. 112 (14-15) (2012)
Daniel Reidenbach, Markus L. Schmid
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. LATA (2011)
Daniel Reidenbach, Johannes C. Schneider
Restricted ambiguity of erasing morphisms. Theor. Comput. Sci. 412 (29) (2011)
Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach
Weakly Unambiguous Morphisms. STACS (2011)
Hossein Nevisi, Daniel Reidenbach
Unambiguous 1-Uniform Morphisms WORDS (2011)
Dominik D. Freydenberger, Daniel Reidenbach
Existence and nonexistence of descriptive patterns. Theor. Comput. Sci. 411 (34-36) (2010)
Dominik D. Freydenberger, Daniel Reidenbach
Inferring Descriptive Generalisations of Formal Languages. COLT (2010)
Daniel Reidenbach, Johannes C. Schneider
Restricted Ambiguity of Erasing Morphisms. Developments in Language Theory (2010)
Daniel Reidenbach, Markus L. Schmid
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CIAA (2010)
Dominik D. Freydenberger, Daniel Reidenbach
Bad news on decision problems for patterns. Inf. Comput. 208 (1) (2010)
Daniel Reidenbach, Johannes C. Schneider
Morphically primitive words. Theor. Comput. Sci. 410 (21-23) (2009)
Dominik D. Freydenberger, Daniel Reidenbach
The unambiguity of segmented morphisms. Discret. Appl. Math. 157 (14) (2009)
Dominik D. Freydenberger, Daniel Reidenbach
Existence and Nonexistence of Descriptive Patterns. Developments in Language Theory (2009)
Daniel Reidenbach
Discontinuities in pattern inference. Theor. Comput. Sci. 397 (1-3) (2008)
Dominik D. Freydenberger, Daniel Reidenbach
Bad News on Decision Problems for Patterns. Developments in Language Theory (2008)
Dominik D. Freydenberger, Daniel Reidenbach
The Unambiguity of Segmented Morphisms. Developments in Language Theory (2007)
Daniel Reidenbach
An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. J. Autom. Lang. Comb. 12 (3) (2007)
Daniel Reidenbach
A non-learnable class of E-pattern languages. Theor. Comput. Sci. 350 (1) (2006)
Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider
Unambiguous Morphic Images of Strings. Int. J. Found. Comput. Sci. 17 (3) (2006)
Daniel Reidenbach
The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages. Ausgezeichnete Informatikdissertationen (2006)
Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider
Unambiguous Morphic Images of Strings. Developments in Language Theory (2005)
Daniel Reidenbach
A Discontinuity in Pattern Inference. STACS (2004)
Daniel Reidenbach
On the Equivalence Problem for E-pattern Languages over Small Alphabets. Developments in Language Theory (2004)
Daniel Reidenbach
On the Learnability of E-pattern Languages over Small Alphabets. COLT (2004)
Daniel Reidenbach
A Negative Result on Inductive Inference of Extended Pattern Languages. ALT (2002)
Kerstin Faber, Dirk Krechel, Daniel Reidenbach, Aldo von Wangenheim, Paulo Roberto Wille
Modelling of Radiological Examinations with POKMAT, a Process Oriented Knowledge Management Tool. AIME (2001)
Dirk Krechel, Kerstin Maximini, Daniel Reidenbach, Aldo von Wangenheim
Process Oriented Knowledge Management for Radiological Examinations. CBMS (2001)
Dirk Krechel, Kerstin Faber, Daniel Reidenbach, Klaus Blasinger, Aldo von Wangenheim, Eros Comunello
A Workflow Component for Knowledge Management in the Field of Radiological Examinations. Bildverarbeitung für die Medizin (2000)

Daniel Reidenbach.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel Reidenbach