| Publication | Date of Publication | Type |
|---|
| Simplifying the role of signals in tile self-assembly | 2024-02-09 | Paper |
| Power of controlled insertion and deletion | 2024-01-29 | Paper |
| Conjugate word blending: formal model and experimental implementation by XPCR | 2023-09-08 | Paper |
| Descriptional Complexity of Semi-Simple Splicing Systems | 2023-08-15 | Paper |
| Watson-Crick powers of a word | 2023-07-26 | Paper |
| STRING OPERATIONS SUGGESTED BY DNA BIOCHEMISTRY: THE BALANCED CUT OPERATION | 2022-12-06 | Paper |
| Descriptional complexity of semi-simple splicing systems | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867521 | 2022-09-14 | Paper |
| Insertion and deletion of words: determinism and reversibility | 2022-08-18 | Paper |
| Two lower bounds on distributive generation of languages | 2022-08-18 | Paper |
| Involutive Fibonacci words | 2022-03-11 | Paper |
| State complexity of overlap assembly | 2021-04-19 | Paper |
| Ciliate gene unscrambling with fewer templates | 2021-02-24 | Paper |
| State complexity of catenation combined with star and reversal | 2021-02-24 | Paper |
| Word blending in formal languages | 2020-06-21 | Paper |
| State complexity of simple splicing | 2020-05-12 | Paper |
| State complexity of pseudocatenation | 2019-12-04 | Paper |
| On the overlap assembly of strings and languages | 2019-07-10 | Paper |
| 3-color bounded patterned self-assembly | 2019-07-08 | Paper |
| Efficient algorithms for computing the inner edit distance of a regular language via transducers | 2019-01-21 | Paper |
| Subapical bracketed L-systems | 2019-01-10 | Paper |
| State complexity of overlap assembly | 2018-11-07 | Paper |
| Word blending in formal languages: the Brangelina effect | 2018-10-18 | Paper |
| Relative Watson-Crick primitivity of words | 2018-09-17 | Paper |
| Transducer descriptions of DNA code properties and undecidability of antimorphic problems | 2018-03-21 | Paper |
| Smart tile self-assembly and replication | 2018-01-19 | Paper |
| The power of nondeterminism in self-assembly | 2017-09-29 | Paper |
| Disjunctivity and other properties of sets of pseudo-bordered words | 2017-06-09 | Paper |
| Binary pattern tile set synthesis is NP-hard | 2017-05-11 | Paper |
| Further remarks on DNA overlap assembly | 2017-03-16 | Paper |
| Generating the pseudo-powers of a word | 2016-12-16 | Paper |
| Deciding whether a regular language is generated by a splicing system | 2016-11-14 | Paper |
| De Bruijn sequences revisited | 2016-07-26 | Paper |
| A formal language model of DNA polymerase enzymatic activity | 2016-05-11 | Paper |
| Methods for relativizing properties of codes | 2016-05-03 | Paper |
| Binary pattern tile set synthesis is NP-hard | 2015-10-27 | Paper |
| Transducer descriptions of DNA code properties and undecidability of antimorphic problems | 2015-08-07 | Paper |
| Hypergraph automata: a theoretical model for patterned self-assembly | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191568 | 2014-10-06 | Paper |
| On the maximality of languages with combined types of code properties | 2014-08-26 | Paper |
| 3-color bounded patterned self-assembly (extended abstract) | 2014-07-07 | Paper |
| State complexity of star of union and square of union on \textit{k} regular languages | 2014-01-10 | Paper |
| Hypergraph automata: a theoretical model for patterned self-assembly | 2013-06-28 | Paper |
| DE BRUIJN SEQUENCES REVISITED | 2013-06-06 | Paper |
| Negative interactions in irreversible self-assembly | 2013-05-16 | Paper |
| Deciding whether a regular language is generated by a splicing system | 2012-11-06 | Paper |
| State complexity of star and square of union of \(k\) regular languages | 2012-11-02 | Paper |
| State complexity of union and intersection of square and reversal on \(k\) regular languages | 2012-10-11 | Paper |
| One-reversal counter machines and multihead automata: revisited | 2012-10-11 | Paper |
| State complexity of two combined operations: catenation-star and catenation-reversal | 2012-08-30 | Paper |
| Schema for parallel insertion and deletion: revisited | 2012-08-29 | Paper |
| State complexity of combined operations with two basic operations | 2012-08-08 | Paper |
| Triangular and hexagonal tile self-assembly systems | 2012-06-15 | Paper |
| Iterated hairpin completions of non-crossing words | 2012-06-15 | Paper |
| State complexity of union and intersection of star on \(k\) regular languages | 2012-05-30 | Paper |
| Relativized codes | 2012-05-30 | Paper |
| Pseudopower avoidance | 2012-05-04 | Paper |
| State complexity of two combined operations: catenation-union and catenation-intersection | 2012-03-13 | Paper |
| Polyominoes simulating arbitrary-neighborhood zippers and tilings | 2011-12-19 | Paper |
| \(K\)-comma codes and their generalizations | 2011-11-22 | Paper |
| On the regularity of iterated hairpin completion of a single word | 2011-11-22 | Paper |
| An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality | 2011-06-14 | Paper |
| Towards a neighborhood simplification of tile systems: from Moore to quasi-linear dependencies | 2011-05-23 | Paper |
| An extension of the Lyndon-Schützenberger result to pseudoperiodic words | 2011-04-28 | Paper |
| PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS | 2011-03-30 | Paper |
| Orthogonal shuffle on trajectories | 2011-02-23 | Paper |
| Block insertion and deletion on trajectories | 2011-02-21 | Paper |
| One-reversal counter machines and multihead automata: revisited | 2011-02-15 | Paper |
| State complexity of catenation combined with union and intersection | 2011-02-11 | Paper |
| Triangular tile self-assembly systems | 2011-01-28 | Paper |
| Negative interactions in irreversible self-assembly | 2011-01-28 | Paper |
| Scalable, time-responsive, digital, energy-efficient molecular circuits using DNA strand displacement | 2011-01-28 | Paper |
| Involutively bordered words | 2011-01-06 | Paper |
| Watson-Crick palindromes in DNA computing | 2010-09-16 | Paper |
| Schema for parallel insertion and deletion | 2010-08-31 | Paper |
| On a special class of primitive words | 2010-02-05 | Paper |
| The undecidability of the infinite ribbon problem: implications for computing by self-assembly | 2010-01-06 | Paper |
| On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes | 2009-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396004 | 2009-09-15 | Paper |
| On the descriptional complexity of Watson-Crick automata | 2009-08-07 | Paper |
| An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words | 2009-07-07 | Paper |
| Twin-roots of words and their properties | 2009-06-04 | Paper |
| Aspects of Molecular Computing | 2009-05-14 | Paper |
| Hairpin Structures in DNA Words | 2009-04-02 | Paper |
| Involution Solid and Join Codes | 2009-03-26 | Paper |
| On pseudoknot-bordered words and their properties | 2009-03-11 | Paper |
| On a Special Class of Primitive Words | 2009-02-03 | Paper |
| Involution solid and join codes | 2009-01-28 | Paper |
| WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID | 2008-12-01 | Paper |
| Duplication in DNA Sequences | 2008-10-30 | Paper |
| On the weight of universal insertion grammars | 2008-05-28 | Paper |
| Watson-Crick Conjugate and Commutative Words | 2008-04-04 | Paper |
| DNA Codes and Their Properties | 2008-04-04 | Paper |
| k-involution codes and related sets | 2008-03-06 | Paper |
| The syntactic monoid of hairpin-free languages | 2007-08-17 | Paper |
| Block substitutions and their properties | 2006-11-21 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485998 | 2006-09-06 | Paper |
| A formal language analysis of DNA hairpin structures | 2006-08-28 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS | 2005-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5313794 | 2005-09-01 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS | 2005-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3022285 | 2005-06-23 | Paper |
| On properties of bond-free DNA languages | 2005-06-01 | Paper |
| Aspects of shuffle and deletion on trajectories | 2005-04-06 | Paper |
| Language equations, maximality and error-detection | 2005-02-23 | Paper |
| Computationally universal P systems without priorities: Two catalysts are sufficient | 2005-02-22 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Sticky-free and overhang-free DNA languages | 2004-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819884 | 2004-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738305 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737635 | 2004-08-11 | Paper |
| Families of languages defined by ciliate bio-operations | 2004-08-10 | Paper |
| Closure and decidability properties of some language classes with respect to ciliate bio-operations. | 2004-03-14 | Paper |
| Morphisms preserving densities | 2003-09-11 | Paper |
| Coding properties of DNA languages. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412104 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782123 | 2003-03-20 | Paper |
| A computer scientist's guide to molecular biology | 2002-07-25 | Paper |
| DNA computing in vitro and in vivo | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520315 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762333 | 2001-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790428 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941174 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263694 | 2000-10-17 | Paper |
| Using DNA to solve the bounded Post correspondence problem | 2000-08-23 | Paper |
| Shuffle and scattered deletion closure of languages | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942039 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939189 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260384 | 1999-09-19 | Paper |
| DNA computing based on splicing: The existence of universal computers | 1999-06-21 | Paper |
| DNA computing: Arrival of biological mathematics | 1999-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839708 | 1999-05-18 | Paper |
| DNA computing, sticker systems, and universality | 1998-11-08 | Paper |
| Insertion and deletion closure of languages | 1998-07-22 | Paper |
| Contextual insertions/deletions and computability | 1997-10-13 | Paper |
| K-catenation and applications:k-prefix codes | 1997-08-24 | Paper |
| Maximal and minimal solutions to language equations | 1997-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125166 | 1997-03-16 | Paper |
| Multi-pattern languages | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878716 | 1996-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862850 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886801 | 1996-07-23 | Paper |
| Teams in cooperating grammar systems | 1996-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864791 | 1996-06-27 | Paper |
| Languages and monoids with disjunctive identity | 1996-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874656 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852886 | 1995-10-25 | Paper |
| On parallel deletions applied to a word | 1995-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304539 | 1995-06-08 | Paper |
| On language equations with invertible operations | 1994-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142559 | 1994-05-19 | Paper |
| Some hierarchies for the communication complexity measures of cooperating grammar systems | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4271919 | 1993-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5285978 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005189 | 1992-09-27 | Paper |
