default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Reidenbach
Person information
- affiliation: Loughborough University, UK
- affiliation (PhD 2006): Kaiserslautern University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Szymon Lopaciuk
, Daniel Reidenbach:
On Billaud words and their companions. Theor. Comput. Sci. 940(Part): 231-253 (2023)- 2022
- [j25]Joel D. Day, Daniel Reidenbach:
Unambiguous injective morphisms in free groups. Inf. Comput. 289(Part): 104946 (2022) - [c30]Szymon Lopaciuk, Daniel Reidenbach:
The Billaud Conjecture for ${|{\varSigma } |} = 4$, and Beyond. DLT 2022: 213-225 - [c29]Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
A Toolkit for Parikh Matrices. CIAA 2022: 116-127 - 2021
- [j24]Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the ambiguity of Parikh matrices. Theor. Comput. Sci. 860: 23-40 (2021) - [c28]Szymon Lopaciuk, Daniel Reidenbach:
On Billaud Words and Their Companions. WORDS 2021: 129-141 - 2020
- [j23]Szilárd Zsolt Fazekas, Robert Mercas, Daniel Reidenbach:
On the Prefix-Suffix Duplication Reduction. Int. J. Found. Comput. Sci. 31(1): 91-102 (2020) - [j22]Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Unique decipherability in formal languages. Theor. Comput. Sci. 804: 149-160 (2020) - [c27]Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the Ambiguity of Parikh Matrices. LATA 2020: 397-411
2010 – 2019
- 2019
- [e1]Robert Mercas, Daniel Reidenbach:
Combinatorics on Words - 12th International Conference, WORDS 2019, Loughborough, UK, September 9-13, 2019, Proceedings. Lecture Notes in Computer Science 11682, Springer 2019, ISBN 978-3-030-28795-5 [contents] - 2017
- [j21]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure properties of pattern languages. J. Comput. Syst. Sci. 84: 11-31 (2017) - [i2]Daniel Reidenbach, Markus L. Schmid:
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CoRR abs/1707.04097 (2017) - 2015
- [j20]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity forcing words. Theor. Comput. Sci. 601: 2-14 (2015) - [c26]Joel D. Day, Daniel Reidenbach:
Ambiguity of Morphisms in a Free Group. WORDS 2015: 97-108 - [c25]Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. DLT 2015: 97-107 - [i1]Paul Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. CoRR abs/1503.06365 (2015) - 2014
- [j19]Paul Bell, Daniel Reidenbach:
Report on BCTCS 2014. Bull. EATCS 113 (2014) - [j18]Daniel Reidenbach, Markus L. Schmid:
Patterns with bounded treewidth. Inf. Comput. 239: 87-99 (2014) - [j17]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. Int. J. Found. Comput. Sci. 25(8): 1033-1048 (2014) - [j16]Daniel Reidenbach, Markus L. Schmid:
Automata with modulo counters and nondeterministic counter bounds. Kybernetika 50(1): 66-94 (2014) - [j15]Daniel Reidenbach, Markus L. Schmid:
Regular and context-free pattern languages over small alphabets. Theor. Comput. Sci. 518: 80-95 (2014) - [c24]Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure Properties of Pattern Languages. Developments in Language Theory 2014: 279-290 - 2013
- [j14]Daniel Reidenbach, Markus L. Schmid:
Finding shuffle words that represent optimal scheduling of shared memory access. Int. J. Comput. Math. 90(6): 1292-1309 (2013) - [j13]Dominik D. Freydenberger, Daniel Reidenbach:
Inferring descriptive generalisations of formal languages. J. Comput. Syst. Sci. 79(5): 622-639 (2013) - [j12]Hossein Nevisi, Daniel Reidenbach:
Unambiguous 1-uniform morphisms. Theor. Comput. Sci. 478: 101-117 (2013) - [c23]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
Periodicity Forcing Words. WORDS 2013: 107-118 - [c22]Joel D. Day, Daniel Reidenbach, Johannes C. Schneider:
On the Dual Post Correspondence Problem. Developments in Language Theory 2013: 167-178 - 2012
- [j11]Daniel Reidenbach, Markus L. Schmid:
On multi-head automata with restricted nondeterminism. Inf. Process. Lett. 112(14-15): 572-577 (2012) - [j10]Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly unambiguous morphisms. Theor. Comput. Sci. 448: 21-40 (2012) - [c21]Daniel Reidenbach, Markus L. Schmid:
Regular and Context-Free Pattern Languages over Small Alphabets. Developments in Language Theory 2012: 130-141 - [c20]Hossein Nevisi, Daniel Reidenbach:
Morphic Primitivity and Alphabet Reductions. Developments in Language Theory 2012: 440-451 - [c19]Daniel Reidenbach, Markus L. Schmid:
Patterns with Bounded Treewidth. LATA 2012: 468-479 - [c18]Daniel Reidenbach, Markus L. Schmid:
Automata with Modulo Counters and Nondeterministic Counter Bounds. CIAA 2012: 361-368 - 2011
- [j9]Daniel Reidenbach, Johannes C. Schneider:
Restricted ambiguity of erasing morphisms. Theor. Comput. Sci. 412(29): 3510-3523 (2011) - [c17]Daniel Reidenbach, Markus L. Schmid:
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access. LATA 2011: 465-476 - [c16]Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly Unambiguous Morphisms. STACS 2011: 213-224 - [c15]Hossein Nevisi, Daniel Reidenbach:
Unambiguous 1-Uniform Morphisms. WORDS 2011: 158-167 - 2010
- [j8]Dominik D. Freydenberger, Daniel Reidenbach:
Bad news on decision problems for patterns. Inf. Comput. 208(1): 83-96 (2010) - [j7]Dominik D. Freydenberger, Daniel Reidenbach:
Existence and nonexistence of descriptive patterns. Theor. Comput. Sci. 411(34-36): 3274-3286 (2010) - [c14]Dominik D. Freydenberger, Daniel Reidenbach:
Inferring Descriptive Generalisations of Formal Languages. COLT 2010: 194-206 - [c13]Daniel Reidenbach, Johannes C. Schneider:
Restricted Ambiguity of Erasing Morphisms. Developments in Language Theory 2010: 387-398 - [c12]Daniel Reidenbach, Markus L. Schmid:
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions. CIAA 2010: 241-250
2000 – 2009
- 2009
- [j6]Dominik D. Freydenberger, Daniel Reidenbach:
The unambiguity of segmented morphisms. Discret. Appl. Math. 157(14): 3055-3068 (2009) - [j5]Daniel Reidenbach, Johannes C. Schneider:
Morphically primitive words. Theor. Comput. Sci. 410(21-23): 2148-2161 (2009) - [c11]Dominik D. Freydenberger, Daniel Reidenbach:
Existence and Nonexistence of Descriptive Patterns. Developments in Language Theory 2009: 228-239 - 2008
- [j4]Daniel Reidenbach:
Discontinuities in pattern inference. Theor. Comput. Sci. 397(1-3): 166-193 (2008) - [c10]Dominik D. Freydenberger, Daniel Reidenbach:
Bad News on Decision Problems for Patterns. Developments in Language Theory 2008: 327-338 - 2007
- [j3]Daniel Reidenbach:
An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. J. Autom. Lang. Comb. 12(3): 407-426 (2007) - [c9]Dominik D. Freydenberger, Daniel Reidenbach:
The Unambiguity of Segmented Morphisms. Developments in Language Theory 2007: 181-192 - 2006
- [b1]Daniel Reidenbach:
The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages. Kaiserslautern University of Technology, Germany, Logos-Verlag 2006, ISBN 978-3-8325-1449-5, pp. I-VII, 1-165 - [j2]Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. Int. J. Found. Comput. Sci. 17(3): 601-628 (2006) - [j1]Daniel Reidenbach:
A non-learnable class of E-pattern languages. Theor. Comput. Sci. 350(1): 91-102 (2006) - [p1]Daniel Reidenbach:
The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages. Ausgezeichnete Informatikdissertationen 2006: 159-168 - 2005
- [c8]Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. Developments in Language Theory 2005: 248-259 - 2004
- [c7]Daniel Reidenbach:
On the Learnability of E-pattern Languages over Small Alphabets. COLT 2004: 140-154 - [c6]Daniel Reidenbach:
On the Equivalence Problem for E-pattern Languages over Small Alphabets. Developments in Language Theory 2004: 368-380 - [c5]Daniel Reidenbach:
A Discontinuity in Pattern Inference. STACS 2004: 129-140 - 2002
- [c4]Daniel Reidenbach:
A Negative Result on Inductive Inference of Extended Pattern Languages. ALT 2002: 308-320 - 2001
- [c3]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: 409-412 - [c2]Dirk Krechel, Kerstin Maximini, Daniel Reidenbach, Aldo von Wangenheim:
Process Oriented Knowledge Management for Radiological Examinations. CBMS 2001: 253-258 - 2000
- [c1]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: 439-443
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
