| Publication | Date of Publication | Type |
|---|
| On the difference set of two transductions | 2024-10-07 | Paper |
| Approximate NFA universality and related problems motivated by information theory | 2023-09-07 | Paper |
| Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem | 2023-08-15 | Paper |
| On the average complexity of partial derivative transducers | 2023-04-26 | Paper |
| Approximate NFA universality motivated by information theory | 2023-01-18 | Paper |
| Theoretical and implementational aspects of the formal language server (LaSer) | 2022-12-16 | Paper |
| Partial derivative automaton by compressing regular expressions | 2022-11-09 | Paper |
| On the size of partial derivatives and the word membership problem | 2021-07-23 | Paper |
| Partial derivatives of regular expressions over alphabet-invariant and user-defined labels | 2021-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4988158 | 2021-05-12 | Paper |
| Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels | 2021-04-19 | Paper |
| On the Average State Complexity of Partial Derivative Transducers | 2020-07-20 | Paper |
| Partitioning a symmetric rational relation into two asymmetric rational relations | 2020-05-06 | Paper |
| Partial derivatives of regular expressions over alphabet-invariant and user-defined labels | 2020-05-06 | Paper |
| Power of the Wilcoxon–Mann–Whitney test for non‐inferiority in the presence of death‐censored observations | 2020-01-15 | Paper |
| Randomized generation of error control codes with automata and transducers | 2019-07-18 | Paper |
| Efficient algorithms for computing the inner edit distance of a regular language via transducers | 2019-01-21 | Paper |
| Variable-length codes for error correction | 2019-01-10 | Paper |
| Regular expressions and transducers over alphabet-invariant and user-defined labels | 2018-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376339 | 2018-09-17 | Paper |
| Transducer descriptions of DNA code properties and undecidability of antimorphic problems | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4590911 | 2017-11-20 | Paper |
| Applications of transducers in independent languages, word distances, codes | 2017-08-31 | Paper |
| Implementation of Code Properties via Transducers | 2016-11-09 | Paper |
| \(f\)-words and binary solid codes | 2016-09-29 | Paper |
| Computing maximal Kleene closures that are embeddable in a given subword-closed language | 2016-03-10 | Paper |
| Transducer descriptions of DNA code properties and undecidability of antimorphic problems | 2015-08-07 | Paper |
| On the maximality of languages with combined types of code properties | 2014-08-26 | Paper |
| Formal descriptions of code properties: decidability, complexity, implementation | 2012-08-30 | Paper |
| Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language | 2011-09-16 | Paper |
| Computing Maximal Error-detecting Capabilities and Distances of Regular Languages | 2011-06-14 | Paper |
| On implementing recognizable transductions | 2010-01-26 | Paper |
| State-complexity hierarchies of uniform languages of alphabet-size length | 2009-08-07 | Paper |
| On the definition of stochastic λ-transducers | 2009-07-23 | Paper |
| Hairpin Structures in DNA Words | 2009-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503440 | 2009-01-15 | Paper |
| STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING | 2008-12-01 | Paper |
| DNA Coding Using the Subword Closure Operation | 2008-04-04 | Paper |
| Error-correction, and finite-delay decodability | 2007-10-17 | Paper |
| Computing the edit distance of a regular language | 2007-09-18 | Paper |
| Fuzzification of rational and recognizable sets | 2007-07-24 | Paper |
| Representation and uniformization of algebraic transductions | 2007-01-05 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| A formal language analysis of DNA hairpin structures | 2006-08-28 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| (Near-)inverses of sequences | 2006-05-22 | 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 |
| On properties of bond-free DNA languages | 2005-06-01 | Paper |
| On a simple method for detecting synchronization errors in coded messages | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654643 | 2005-03-08 | Paper |
| Language equations, maximality and error-detection | 2005-02-23 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| Sticky-free and overhang-free DNA languages | 2004-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737635 | 2004-08-11 | Paper |
| Coding properties of DNA languages. | 2003-08-17 | Paper |
| An algebra of discrete channels that involve combinations of three basic error types | 2003-01-14 | Paper |
| Relationships between different error-correcting capabilities of a code | 2002-08-04 | Paper |
| Error-detecting properties of languages | 2002-07-15 | Paper |
| Maximal solid codes | 2001-04-17 | Paper |
| Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types | 1999-11-21 | Paper |
| Error correction for channels with substitutions, insertions, and deletions | 1998-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284228 | 1994-03-24 | Paper |
