| Publication | Date of Publication | Type |
|---|
| On approximately identifying concept classes in the limit | 2023-12-08 | Paper |
| \(\mathcal{L}\)-reduction computation revisited | 2022-08-30 | Paper |
| Corrigendum to: ``On the computing powers of \(\mathcal{L}\)-reductions of insertion languages | 2022-05-17 | Paper |
| Theory of reaction automata: a survey | 2021-09-14 | Paper |
| On the computing powers of \(\mathcal{L}\)-reductions of insertion languages | 2021-03-09 | Paper |
| The Computing Power of Determinism and Reversibility in Chemical Reaction Automata | 2020-05-28 | Paper |
| The computational capability of chemical reaction automata | 2019-07-10 | Paper |
| Decomposition and factorization of chemical reaction transducers | 2019-06-18 | Paper |
| Computing with multisets: a survey on reaction automata theory | 2018-09-06 | Paper |
| Morphic Characterizations of Language Families Based on Local and Star Languages | 2018-01-19 | Paper |
| Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy | 2016-05-11 | Paper |
| A simple classification of the volvocine algae by formal languages | 2016-04-05 | Paper |
| HAIRPIN LANGUAGES | 2015-04-30 | Paper |
| The Computational Capability of Chemical Reaction Automata | 2014-10-08 | Paper |
| On the properties of language classes defined by bounded reaction automata | 2012-10-11 | Paper |
| Reaction automata | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3225710 | 2012-03-22 | Paper |
| On the Hairpin Incompletion | 2011-11-22 | Paper |
| MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES | 2011-02-23 | Paper |
| SOME REMARKS ON THE HAIRPIN COMPLETION | 2010-11-11 | Paper |
| On spiking neural P systems | 2010-09-16 | Paper |
| Aspects of Molecular Computing | 2009-05-14 | Paper |
| Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity | 2009-04-02 | Paper |
| Two complementary operations inspired by the DNA hairpin formation: Completion and reduction | 2009-03-02 | Paper |
| REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS | 2008-09-25 | Paper |
| Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity | 2008-05-20 | Paper |
| Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480659 | 2006-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662847 | 2005-03-30 | Paper |
| On the power of membrane division in P systems | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738307 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470568 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470579 | 2004-07-01 | Paper |
| On the computational power of insertion-deletion systems | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414687 | 2003-07-25 | Paper |
| Polynomial-time identification of very simple grammars from positive data. | 2003-05-22 | Paper |
| Molecular computing paradigm -- toward freedom from Turing's charm | 2003-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4793136 | 2003-02-18 | Paper |
| Corrigendum. Learning two-tape automata from queries and counterexamples | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782115 | 2002-11-27 | Paper |
| Toward soft hardware | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762327 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4762334 | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520824 | 2001-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708949 | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267806 | 1999-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263695 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247007 | 1999-06-16 | Paper |
| Tree adjoining grammars for RNA structure prediction | 1999-01-12 | Paper |
| Learning approximately regular languages with reversible languages | 1998-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370216 | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126921 | 1997-10-22 | Paper |
| FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA | 1997-08-07 | Paper |
| Learning two-tape automata from queries and counterexamples | 1996-05-27 | Paper |
| On polynomial-time learnability in the limit of strictly deterministic automata | 1996-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036762 | 1993-05-18 | Paper |
| Inductive inference of context-free languages based on context-free expressions | 1988-01-01 | Paper |
| Set abstraction - an extension of all solutions predicate in logic programming language | 1987-01-01 | Paper |
| On purely morphic characterizations of context-free languages | 1987-01-01 | Paper |
| Logic program forms | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714466 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769992 | 1986-01-01 | Paper |
| Erratum to: ``A three-restricted normal form theorem for ETOL languages | 1985-01-01 | Paper |
| An inverse homomorphic characterization of full principal AFL | 1984-01-01 | Paper |
| Semi-linearity, Parikh-boundedness and tree adjunct languages | 1983-01-01 | Paper |
| A three-restricted normal form theorem for ETOL languages | 1982-01-01 | Paper |
| Stochastic characterizations of E0L languages | 1980-01-01 | Paper |
