30 research outputs found
An optimal solution to the SAT problem with tissue P systems
In the framework of membrane computing, several frontiers of e ciency have
been found with respect to the resources that di erent families of P systems take to solve
a decision problem. Each of these frontiers provides a new way to tackle the P versus NP
problem. In this sense, optimal frontiers are needed in order to separate close variants of
P systems. In a previous work, an e cient solution to SAT was given in the framework
of P systems from T DC(3). In this work, we will provide an optimal solution to the SAT
problem in terms of length of the rules.Ministerio de Industria, Economía y Competitividad TIN2017-89842-
Fast Hardware Implementations of Static P Systems
In this article we present a simulator of non-deterministic static P systems
using Field Programmable Gate Array (FPGA) technology. Its major feature
is a high performance, achieving a constant processing time for each transition. Our
approach is based on representing all possible applications as words of some regular
context-free language. Then, using formal power series it is possible to obtain the
number of possibilities and select one of them following a uniform distribution, in
a fair and non-deterministic way. According to these ideas, we yield an implementation
whose results show an important speed-up, with a strong independence from
the size of the P system.Ministry of Science and Innovation of the Spanish Government under the project TEC2011-27936 (HIPERSYS)European Regional Development Fund (ERDF)Ministry of Education of Spain (FPU grant AP2009-3625)ANR project SynBioTI
P Colony Automata with LL(k)-like Conditions
We investigate the possibility of the deterministic parsing (that is, parsing
without backtracking) of languages characterized by (generalized) P colony automata.
We de ne a class of P colony automata satisfying a property which resembles the LL(k)
property of context-free grammars, and study the possibility of parsing the characterized
languages using a k symbol lookahead, as in the LL(k) parsing method for context-free
languages
Dynamics of Randomly Constructed Computational Systems
We studied Petri nets with five places constructed in a pseudo-random way:
their underlying net is composed of join and fork. We report initial results linking the
dynamical properties of these systems to the topology of their underlying net.
The obtained results can be easily related to the computational power of some abstract models of computation
On the Simulations of Evolution-Communication P Systems with Energy without Antiport Rules for GPUs
In this report, we present our initial proposal on simulating computations on
a restricted variant of Evolution-Communication P system with energy (ECPe system)
which will then be implemented in Graphics Processing Units (GPUs). This ECPe sys-
tems variant prohibits the use of antiport rules for communication. Several possible levels
of parallelizations for simulating ECPe systems computations on GPUs are emphasized.
Our work is based on a localized matrix representation for the mentioned variant given
in a previous literature. Our proposal employs a methodology for forward computing also
discussed in the said literature.Junta de Andalucía P08-TIC04200Ministerio de Ciencia e Innovación TIN2009–1319
New Choice for Small Universal Devices: Symport/Antiport P Systems
Symport/antiport P systems provide a very simple machinery inspired by
corresponding operations in the living cell. It turns out that systems of small
descriptional complexity are needed to achieve the universality by these
systems. This makes them a good candidate for small universal devices replacing
register machines for different simulations, especially when a simulating
parallel machinery is involved. This article contains survey of these systems
and presents different trade-offs between parameters
Further results on generalised communicating P systems
YesIn this paper we consider four restricted cases of the generalised communicating P systems and
study their computational power, by providing improved results, with respect to the number
of compartments involved. We illustrate the expressive power of these devices by modelling
several problems, such as producer/consumer, work
ow patterns, broadcasting problem and
comparative operations. We also present some relationships between generalised communicating P systems and P colonies, tissue-like P systems with very simple components.MG and FI were supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0688, CSVE by grant No. 120558 of the National Research, Development, and Innovation Office, Hungary