| Publication | Date of Publication | Type |
|---|
| Networks of Watson-Crick D0L systems with communication by substrings | 2024-03-28 | Paper |
| Membrane systems and multiset approximation: the cases of inner and boundary rule application | 2023-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5867517 | 2022-09-14 | Paper |
| Controlled reversibility in communicating reaction systems | 2022-07-08 | Paper |
| Transition graphs of reversible reaction systems | 2021-12-01 | Paper |
| Simulating reversible computation with reaction systems | 2021-09-14 | Paper |
| Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities | 2021-09-14 | Paper |
| Reversible parallel communicating finite automata systems | 2021-07-23 | Paper |
| On the size complexity of non-returning context-free PC grammar systems | 2021-01-26 | Paper |
| On languages of P automata | 2020-06-21 | Paper |
| Deterministic Lindenmayer Systems with Dynamic Control of Parallelism | 2020-02-21 | Paper |
| Local time membrane systems and time Petri nets | 2020-01-08 | Paper |
| Generalized membrane systems with dynamical structure, Petri nets, and multiset approximation spaces | 2019-10-10 | Paper |
| APCol systems with verifier agents | 2019-10-10 | Paper |
| Simulating P systems with membrane dissolution in a chemical calculus | 2019-07-10 | Paper |
| Deterministic parsing with P colony automata | 2019-01-15 | Paper |
| On the complexity of a mildly context-sensitive language class | 2018-09-17 | Paper |
| Generalized P colony automata and their relation to P automata | 2018-05-16 | Paper |
| On the classes of languages characterized by generalized P colony automata | 2018-04-10 | Paper |
| Watson-Crick T0L Systems and Red-Green Register Machines | 2018-01-19 | Paper |
| Chemical term reduction with active P systems | 2017-04-12 | Paper |
| On Lindenmayer systems with dynamic control of parallelism | 2016-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507066 | 2016-12-16 | Paper |
| On the descriptional complexity of context-free non-returning PC grammar systems | 2016-09-29 | Paper |
| Spatially localised membrane systems | 2016-05-11 | Paper |
| Deterministic one-way Turing machines with sublinear space | 2016-05-11 | Paper |
| Dynamically changing environment for generalized communicating P systems | 2016-02-26 | Paper |
| Regulating rule application with membrane boundaries in P systems | 2016-02-26 | Paper |
| A connection between red-green Turing machines and Watson-Crick T0L systems | 2015-09-15 | Paper |
| Describing membrane computations with a chemical calculus | 2015-06-26 | Paper |
| Generalized Communicating P Automata | 2015-04-14 | Paper |
| P automata with restricted power | 2014-11-14 | Paper |
| On Counter Machines versus dP Automata | 2014-03-28 | Paper |
| On the power of P automata | 2013-06-28 | Paper |
| On the nonterminal complexity of tree controlled grammars | 2012-11-01 | Paper |
| Finite dP Automata versus Multi-head Finite Automata | 2012-06-08 | Paper |
| Variants of distributed P automata and the efficient parallelizability of languages | 2012-06-08 | Paper |
| Blackhole pushdown automata | 2012-05-04 | Paper |
| Scattered context grammars generate any recursively enumerable language with two nonterminals | 2012-03-27 | Paper |
| On the number of components and clusters of non-returning parallel communicating grammar systems | 2011-07-29 | Paper |
| On the parallelizability of languages accepted by P automata | 2011-06-24 | Paper |
| Cooperating distributed grammar systems: components with nonincreasing competence | 2011-06-24 | Paper |
| ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS | 2011-02-23 | Paper |
| PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS | 2011-02-23 | Paper |
| On Generalized Communicating P Systems with One Symbol | 2011-01-21 | Paper |
| Variants of competence-based derivations in CD grammar systems | 2010-09-06 | Paper |
| On competence in CD grammar systems with parallel rewriting | 2010-01-29 | Paper |
| DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS | 2009-06-23 | Paper |
| Self-assembly of strings and languages | 2009-06-22 | Paper |
| Membrane Computing | 2009-05-15 | Paper |
| Ciliate Bio-operations on Finite String Multisets | 2009-03-26 | Paper |
| TISSUE-LIKE P SYSTEMS WITH DYNAMICALLY EMERGING REQUESTS | 2008-11-24 | Paper |
| (Mem)brane automata | 2008-11-06 | Paper |
| Some New Modes of Competence-Based Derivations in CD Grammar Systems | 2008-10-30 | Paper |
| Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components | 2008-08-12 | Paper |
| P Systems with String Objects and with Communication by Request | 2008-03-28 | Paper |
| Editing configurations of P systems | 2008-03-19 | Paper |
| Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems | 2008-02-26 | Paper |
| Computing with cells in environment: P colonies | 2008-02-11 | Paper |
| Tissue-like P systems communicating by request | 2007-12-11 | Paper |
| P Finite Automata and Regular Languages over Countably Infinite Alphabets | 2007-09-03 | Paper |
| P Colonies with a Bounded Number of Cells and Programs | 2007-09-03 | Paper |
| On the computational complexity of P automata | 2007-04-19 | Paper |
| Grammar systems versus membrane computing: the case of CD grammar systems | 2007-04-10 | Paper |
| On small universal antiport P systems | 2007-03-27 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Membrane Computing | 2005-09-14 | Paper |
| Membrane Computing | 2005-09-14 | Paper |
| On the descriptional complexity of some rewriting mechanisms regulated by context conditions | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737923 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4453199 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452064 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413828 | 2003-07-21 | Paper |
| PC grammar systems with five context-free components generate all recursively enumerable languages. | 2003-05-25 | Paper |
| Parallel communicating grammar systems with incomplete information communication | 2003-04-27 | Paper |
| Parallel communicating grammar systems with bounded resources | 2002-07-15 | Paper |
| On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms | 2001-08-20 | Paper |
| Parallel communicating grammar systems as language analyzers | 2001-06-21 | Paper |
| PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS | 2001-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934324 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939191 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953242 | 2000-05-09 | Paper |
| Communication in parallel communicating Lindenmayer systems | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269123 | 1999-10-31 | Paper |
| On the computational completeness of context-free parallel communicating grammar systems | 1999-04-29 | Paper |
| On simulating non-returning PC grammar systems with returning systems | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886799 | 1996-12-11 | Paper |
