| Publication | Date of Publication | Type |
|---|
| Identities and transductions | 2024-01-29 | Paper |
| The interlace polynomial and the Tutte–Martin polynomial | 2023-04-28 | Paper |
| MSO definable text languages | 2022-08-18 | Paper |
| Extracting reaction systems from function behavior | 2021-09-14 | Paper |
| Comparing reactions in reaction systems | 2021-08-11 | Paper |
| Companions and an Essential Motion of a Reaction System | 2021-05-20 | Paper |
| XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles | 2020-12-16 | Paper |
| Counterexamples to a conjecture of Las Vergnas | 2020-09-15 | Paper |
| Graphs Associated With DNA Rearrangements and Their Polynomials | 2019-03-11 | Paper |
| Enforcing Regular Languages | 2018-01-19 | Paper |
| A graph isomorphism condition and equivalence of reaction systems | 2017-12-06 | Paper |
| Finite language forbidding-enforcing systems | 2017-08-04 | Paper |
| Graph Polynomials Motivated by Gene Rearrangements in Ciliates | 2015-02-25 | Paper |
| Interlace polynomials for multimatroids and delta-matroids | 2014-08-28 | Paper |
| The adjacency matroid of a graph | 2014-08-14 | Paper |
| The Algebra of Gene Assembly in Ciliates | 2014-06-23 | Paper |
| Nullity and Loop Complementation for Delta-Matroids | 2013-06-27 | Paper |
| Making DNA Expressions Minimal | 2013-06-27 | Paper |
| A Minimal Normal Form for DNA Expressions | 2013-06-27 | Paper |
| Pivots, determinants, and perfect matchings of graphs | 2012-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893295 | 2012-06-20 | Paper |
| Asynchronous Extended Spiking Neural P Systems with Astrocytes | 2012-06-08 | Paper |
| Preface | 2012-05-30 | Paper |
| Spiking Neural P Systems with Astrocytes | 2012-05-21 | Paper |
| The group structure of pivot and loop complementation on graphs and set systems | 2011-11-29 | Paper |
| Limited Asynchronous Spiking Neural P Systems | 2011-11-22 | Paper |
| On aggregation in multiset-based self-assembly of graphs | 2011-05-23 | Paper |
| Nullity invariance for pivot and the interlace polynomial | 2011-04-11 | Paper |
| P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH | 2011-02-23 | Paper |
| Spiking Neural P Systems with Neuron Division | 2011-01-21 | Paper |
| Maximal pivots on graphs with an application to gene assembly | 2010-11-25 | Paper |
| Spiking Neural P Systems with Weights | 2010-11-24 | Paper |
| Pivot and Loop Complementation on Graphs and Set Systems | 2010-06-17 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Combining overlap and containment for gene assembly in ciliates | 2010-02-19 | Paper |
| P SYSTEMS WITH SINGLE PASSENGER CARRIERS | 2010-01-29 | Paper |
| Tetris and decidability | 2009-07-09 | Paper |
| REDUCTION GRAPHS FROM OVERLAP GRAPHS FOR GENE ASSEMBLY IN CILIATES | 2009-06-23 | Paper |
| Perfectly quilted rectangular snake tilings | 2009-04-16 | Paper |
| Computing by Only Observing | 2009-03-26 | Paper |
| Extending the Overlap Graph for Gene Assembly in Ciliates | 2008-11-20 | Paper |
| Strategies of loop recombination in ciliates | 2008-09-10 | Paper |
| The fibers and range of reduction graphs in ciliates | 2008-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504341 | 2008-06-11 | Paper |
| Nested Pebbles and Transitive Closure | 2008-03-19 | Paper |
| From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates | 2008-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431915 | 2008-01-02 | Paper |
| Characterizing Reduction Graphs for Gene Assembly in Ciliates | 2007-11-28 | Paper |
| High Spies (or How to Win a Programming Contest) | 2007-11-15 | Paper |
| Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure | 2007-10-11 | Paper |
| The construction of minimal DNA expressions | 2007-04-19 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| Reducibility of gene patterns in ciliates using the breakpoint graph. | 2006-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5716610 | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662826 | 2005-03-30 | Paper |
| P systems with symport/antiport simulating counter automata | 2005-02-09 | Paper |
| TETRIS IS HARD, EVEN TO APPROXIMATE | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737916 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738304 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413833 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412106 | 2003-07-13 | Paper |
| MSO definable string transductions and two-way finite-state transducers | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782119 | 2003-05-12 | Paper |
| Sequences of languages in forbidding-enforcing families | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329022 | 2002-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762332 | 2001-06-21 | Paper |
| Fair sticker languages | 2001-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938634 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941149 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269133 | 1999-10-31 | Paper |
| The code problem for traces -- improving the boundaries | 1998-07-23 | Paper |
| Monadic second-order definable text languages | 1997-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874660 | 1996-04-28 | Paper |
| Combinatorial properties of dependence graphs | 1995-01-11 | Paper |
| \(X\)-automata on \(\omega\)-words | 1993-08-30 | Paper |
| On the structure of recognizable languages of dependence graphs | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210909 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3474898 | 1989-01-01 | Paper |
| Characterizations of the decidability of some problems for regular trace languages | 1989-01-01 | Paper |
| Recording the use of memory in right-boundary grammars and push-down automata | 1988-01-01 | Paper |
| Prefix and equality languages of rational functions are co-context-free | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774928 | 1987-01-01 | Paper |
| On the active and full use of memory in right-boundary grammars and push- down automata | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746904 | 1986-01-01 | Paper |
| Coordinated pair systems ; part I : Dyck works and classical pumping | 1986-01-01 | Paper |
| Coordinated pair systems ; part II : sparse structure of Dyck words and Ogden's lemma | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783606 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738587 | 1985-01-01 | Paper |
