Buscar
Mostrando ítems 1-5 de 5
Ponencia
A new perspective on computational complexity theory in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
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 ...
Ponencia
New applications for an old tool
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
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 ...
Ponencia
P Systems: from Anti-Matter to Anti-Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
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. ...
Ponencia
A syntax for semantics in P-Lingua
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
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 ...
Ponencia
An apparently innocent problem in Membrane Computing
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
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 ...