RESEARCH GROUP ON NATURAL COMPUTING (COORDINADOR)

No description

In the area of P systems, besides the standard maximally parallel derivation mode, many other derivation modes have been investigated, too. In this paper, many variants of hierarchical P systems and tissue P systems using different derivation modes are considered and the effects of using di erent derivation modes, especially the...

We show how to implement the DBSCAN clustering algorithm (Density Based Spatial Clustering of Applications with Noise) on membrane systems using evolution rules with promoters and priorities.

We continue the investigations on exploring the connection between membrane systems and time Petri nets already commenced in [4] by extending membrane systems with promoters/inhibitors, membrane dissolution and priority for rules compared to the simple symbol-object membrane system. By constructing the simulating Petri net, we retain one of the...

The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for membranes as objects and anti-membranes as the corresponding annihilation counterpart in P systems. Natural numbers can be represented by the corresponding number of membranes with a speci c label. Computational completeness in...

Register machines are a classic model of computing, often seen as a canonical example of a device manipulating natural numbers. In this paper, we de ne register machines operating on general groups instead. This generalization follows the research direction started in multiple previous works. We study the expressive power of register machines...

This paper presents a testing approach for kernel P Systems (kP systems), based on test data generation for a given scenario. This method uses Genetic Algorithms to generate the input sets needed to trigger the given computation steps.

In this paper we continue our investigations in APCol systems (Automatonlike P colonies), variants of P colonies where the environment of the agents is given by a string and the functioning of the system resembles to the functioning of standard nite automaton. We rst deal with the concept of determinism in these systems and...

We prove that monodirectional shallow chargeless P systems with active membranes and minimal cooperation working in polynomial time precisely characterise P#P k , the complexity class of problems solved in polynomial time by deterministic Turing machines with a polynomial number of parallel queries to an oracle for a counting problem.

The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for rule labels as objects and anti-rule labels as the corresponding annihilation counterpart in P systems. In the presence of a corresponding anti-rule object, annihilation of a rule object happens before the rule that the rule...

No description

No description

No description

No description

Ministerio de Industria, Economía y Competitividad TIN2017-89842-P

A single Turing machine can solve decision problems with an in nite number of instances. On the other hand, in the framework of membrane computing, a \solution" to an abstract decision problem consists of a family of membrane systems (where each system of the family is associated with a nite set of instances of the problem to be solved). An...

The search for effcient solutions of computationally hard problems by means of families of membrane systems has lead to a wide and prosperous eld of research. The study of computational complexity theory in Membrane Computing is mainly based on the look for frontiers of effciency between different classes of membrane systems. Every frontier...

Ministerio de Industria, Economía y Competitividad TIN2017-89842-P

No description

No description

No description

P-Lingua is a software framework for Membrane Computing, it includes a programming language, also called P-Lingua, for writting P system de nitions using a syntax close to standard scienti c notation. The rst line of a P-Lingua le is an unique identi er de ning the variant or model of P system to be used, i.e, the semantics of the P system....

First, the dependency graph technique, not so far from its current application, was developed trying to nd the shortest computations for membrane systems solving instances of SAT. Certain families of membrane systems have been demonstrated to be non-effcient by means of the reduction of nding an accepting computation (respectively, rejecting...

No description

No description