Daniel Reidenbach
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On Billaud words and their companions Theoretical Computer Science | 2023-04-20 | Paper |
| Unambiguous injective morphisms in free groups Information and Computation | 2022-12-08 | Paper |
| A toolkit for Parikh matrices | 2022-08-16 | Paper |
| The Billaud conjecture for \(|\varSigma| = 4\), and beyond | 2022-08-11 | Paper |
| On Billaud words and their companions Lecture Notes in Computer Science | 2022-05-20 | Paper |
| Reducing the ambiguity of Parikh matrices Theoretical Computer Science | 2021-03-09 | Paper |
| Reducing the ambiguity of Parikh matrices Language and Automata Theory and Applications | 2020-07-27 | Paper |
| On the prefix-suffix duplication reduction International Journal of Foundations of Computer Science | 2020-02-21 | Paper |
| Unique decipherability in formal languages Theoretical Computer Science | 2019-12-27 | Paper |
| Closure properties of pattern languages Journal of Computer and System Sciences | 2016-11-14 | Paper |
| Unambiguous 1-uniform morphisms Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
| Factorization in formal languages Developments in Language Theory | 2015-11-10 | Paper |
| Ambiguity of morphisms in a free group Lecture Notes in Computer Science | 2015-11-04 | Paper |
| Periodicity forcing words Theoretical Computer Science | 2015-09-16 | Paper |
| On the dual Post correspondence problem International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
| Patterns with bounded treewidth Information and Computation | 2014-11-28 | Paper |
| Closure properties of pattern languages Developments in Language Theory | 2014-10-14 | Paper |
| Automata with modulo counters and nondeterministic counter bounds | 2014-05-20 | Paper |
| Regular and context-free pattern languages over small alphabets Theoretical Computer Science | 2014-01-13 | Paper |
| Finding shuffle words that represent optimal scheduling of shared memory access International Journal of Computer Mathematics | 2013-10-22 | Paper |
| Periodicity forcing words Lecture Notes in Computer Science | 2013-09-20 | Paper |
| Inferring descriptive generalisations of formal languages Journal of Computer and System Sciences | 2013-07-24 | Paper |
| On the dual Post correspondence problem Developments in Language Theory | 2013-06-28 | Paper |
| Unambiguous 1-uniform morphisms Theoretical Computer Science | 2013-06-06 | Paper |
| Regular and Context-Free Pattern Languages over Small Alphabets Developments in Language Theory | 2012-11-02 | Paper |
| Morphic primitivity and alphabet reductions Developments in Language Theory | 2012-11-02 | Paper |
| Automata with modulo counters and nondeterministic counter bounds Implementation and Application of Automata | 2012-09-20 | Paper |
| Weakly unambiguous morphisms Theoretical Computer Science | 2012-08-09 | Paper |
| On multi-head automata with restricted nondeterminism Information Processing Letters | 2012-07-25 | Paper |
| Patterns with Bounded Treewidth Language and Automata Theory and Applications | 2012-06-08 | Paper |
| Weakly unambiguous morphisms | 2012-01-23 | Paper |
| Restricted ambiguity of erasing morphisms Theoretical Computer Science | 2011-07-14 | Paper |
| Finding shuffle words that represent optimal scheduling of shared memory access Language and Automata Theory and Applications | 2011-06-03 | Paper |
| A polynomial time match test for large classes of extended regular expressions Implementation and Application of Automata | 2011-02-11 | Paper |
| Restricted ambiguity of erasing morphisms Developments in Language Theory | 2010-08-31 | Paper |
| Existence and nonexistence of descriptive patterns Theoretical Computer Science | 2010-08-11 | Paper |
| The unambiguity of segmented morphisms Discrete Applied Mathematics | 2010-04-28 | Paper |
| Bad news on decision problems for patterns Information and Computation | 2010-01-12 | Paper |
| Existence and Nonexistence of Descriptive Patterns Developments in Language Theory | 2009-07-07 | Paper |
| Morphically primitive words Theoretical Computer Science | 2009-05-28 | Paper |
| Bad News on Decision Problems for Patterns Developments in Language Theory | 2008-10-30 | Paper |
| An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages | 2008-08-12 | Paper |
| Discontinuities in pattern inference Theoretical Computer Science | 2008-05-28 | Paper |
| The Unambiguity of Segmented Morphisms Developments in Language Theory | 2007-11-28 | Paper |
| STACS 2004 Lecture Notes in Computer Science | 2007-10-01 | Paper |
| UNAMBIGUOUS MORPHIC IMAGES OF STRINGS International Journal of Foundations of Computer Science | 2006-08-14 | Paper |
| Developments in Language Theory Lecture Notes in Computer Science | 2006-06-23 | Paper |
| A non-learnable class of E-pattern languages Theoretical Computer Science | 2006-03-20 | Paper |
| Developments in Language Theory Lecture Notes in Computer Science | 2005-12-22 | Paper |
| Learning Theory Lecture Notes in Computer Science | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 1966625 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1754146 (Why is no real title available?) | 2002-06-11 | Paper |
Research outcomes over time
This page was built for person: Daniel Reidenbach
