| Publication | Date of Publication | Type |
|---|
| Roots in the semiring of finite deterministic dynamical systems | 2024-11-13 | Paper |
Polynomial-delay generation of functional digraphs up to isomorphism
Discrete Applied Mathematics | 2024-09-26 | Paper |
Decomposition and factorisation of transients in functional graphs
Theoretical Computer Science | 2024-05-06 | Paper |
Polynomial Equations over Finite, Discrete-Time Dynamical Systems
Developments in Language Theory | 2023-06-30 | Paper |
A Turing machine simulation by P systems without charges
Journal of Membrane Computing | 2021-09-14 | Paper |
Facilitation in reaction systems
Journal of Membrane Computing | 2021-09-14 | Paper |
Simulating counting oracles with cooperation
Journal of Membrane Computing | 2021-09-14 | Paper |
Shallow laconic P-systems can count
Journal of Membrane Computing | 2021-09-14 | Paper |
On the dynamical behaviour of linear higher-order cellular automata and its decidability
Information Sciences | 2020-12-10 | Paper |
| Profiles of dynamical systems and their algebra | 2020-08-03 | Paper |
The many roads to the simulation of reaction systems
Fundamenta Informaticae | 2020-06-21 | Paper |
Characterizing PSPACE with shallow non-confluent P systems
Journal of Membrane Computing | 2020-02-24 | Paper |
Characterizing PSPACE with shallow non-confluent P systems
Journal of Membrane Computing | 2020-02-24 | Paper |
Subroutines in P systems and closure properties of their complexity classes
Theoretical Computer Science | 2020-01-08 | Paper |
| Decidability of sensitivity and equicontinuity for linear higher-order cellular automata | 2019-12-04 | Paper |
Solving QSAT in sublinear depth
(available as arXiv preprint) | 2019-10-10 | Paper |
Monodirectional P systems
Natural Computing | 2019-07-10 | Paper |
Complexity of the dynamics of reaction systems
Information and Computation | 2019-05-29 | Paper |
| Open problems in membrane computing and how not to solve them | 2019-01-15 | Paper |
On the complexity of occurrence and convergence problems in reaction systems
Natural Computing | 2018-06-25 | Paper |
| Solving a special case of the P conjecture using dependency graphs with dissolution | 2018-05-16 | Paper |
Efficient simulation of reaction systems on graphics processing units
Fundamenta Informaticae | 2018-01-19 | Paper |
Tissue P systems with small cell volume
Fundamenta Informaticae | 2018-01-19 | Paper |
The counting power of P systems with antimatter
Theoretical Computer Science | 2017-12-06 | Paper |
Characterising the complexity of tissue P systems with fission rules
Journal of Computer and System Sciences | 2017-09-15 | Paper |
A toolbox for simpler active membrane algorithms
Theoretical Computer Science | 2017-05-02 | Paper |
Shallow non-confluent P systems
Membrane Computing | 2017-04-12 | Paper |
Purely Catalytic P Systems over Integers and Their Generative Power
Membrane Computing | 2017-04-12 | Paper |
Computational complexity of finite asynchronous cellular automata
Theoretical Computer Science | 2017-03-16 | Paper |
| A gap in the space hierarchy of P systems with active membranes | 2016-12-16 | Paper |
Membrane division, oracles, and the counting hierarchy
Fundamenta Informaticae | 2016-05-11 | Paper |
Reachability in resource-bounded reaction systems
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Complexity classes for membrane systems: a survey
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Preimage problems for reaction systems
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Complexity of model checking for reaction systems
Theoretical Computer Science | 2016-03-31 | Paper |
Tissue P systems can be simulated efficiently with counting oracles
Membrane Computing | 2016-02-26 | Paper |
Recent complexity-theoretic results on P systems with active membranes
Journal Of Logic And Computation | 2016-01-28 | Paper |
Ancestors, descendants, and gardens of Eden in reaction systems
Theoretical Computer Science | 2015-12-10 | Paper |
Simulating elementary active membranes
Membrane Computing | 2015-12-02 | Paper |
P Systems with Active Membranes Working in Sublinear Space
Membrane Computing | 2015-12-02 | Paper |
Constant-space P systems with active membranes
Fundamenta Informaticae | 2015-06-26 | Paper |
Fixed points and attractors of reaction systems
Language, Life, Limits | 2015-02-25 | Paper |
Simple reaction systems and their classification
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Cycles and global attractors of reaction systems
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Enzymatic numerical P systems using elementary arithmetic operations
Membrane Computing | 2014-03-28 | Paper |
Flattening in (tissue) P systems
Membrane Computing | 2014-03-28 | Paper |
Flattening and simulation of asynchronous divisionless P systems with active membranes
Membrane Computing | 2014-03-28 | Paper |
Space complexity equivalence of P systems with active membranes and Turing machines
Theoretical Computer Science | 2014-03-19 | Paper |
Reaction systems made simple. A normal form and a classification theorem
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Sublinear-space P systems with active membranes
Membrane Computing | 2013-04-16 | Paper |
P systems simulating oracle computations
Membrane Computing | 2012-06-08 | Paper |
P systems with active membranes: Trading time for space
Natural Computing | 2011-05-23 | Paper |
P systems with active membranes working in polynomial space
International Journal of Foundations of Computer Science | 2011-02-23 | Paper |
P Systems with Elementary Active Membranes: Beyond NP and coNP
Membrane Computing | 2011-01-21 | Paper |
On a powerful class of non-universal P systems with active membranes
Developments in Language Theory | 2010-08-31 | Paper |
Computational complexity aspects in membrane computing
Programs, Proofs, Processes | 2010-07-29 | Paper |
Non-confluence in divisionless P systems with active membranes
Theoretical Computer Science | 2010-02-19 | Paper |
An efficient simulation of polynomial-space Turing machines by P systems with active membranes
Membrane Computing | 2010-01-26 | Paper |
Complexity classes for membrane systems
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Complexity classes for membrane systems
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Complexity classes for membrane systems
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
