Daniel Reidenbach

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