scholarly journals An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

Author(s):  
Andrea Valsecchi ◽  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron
2014 ◽  
Vol 529 ◽  
pp. 69-81 ◽  
Author(s):  
Artiom Alhazov ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Antonio E. Porreca ◽  
Claudio Zandron

2011 ◽  
Vol 22 (01) ◽  
pp. 65-73 ◽  
Author(s):  
ANTONIO E. PORRECA ◽  
ALBERTO LEPORATI ◽  
GIANCARLO MAURI ◽  
CLAUDIO ZANDRON

We prove that recognizer P systems with active membranes using polynomial space characterize the complexity class PSPACE. This result holds for both confluent and nonconfluent systems, and independently of the use of membrane division rules.


Author(s):  
Miguel A. Gutiérrez-Naranjo ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez ◽  
Francisco J. Romero-Campero
Keyword(s):  

Author(s):  
José María Cecilia Canales ◽  
José Manuel García Carrasco ◽  
Ginés David Guerrero Hernandez ◽  
Miguel Ángel Martínez del Amor ◽  
Ignacio Pérez Hurtado de Mendoza ◽  
...  
Keyword(s):  

2008 ◽  
Vol 8 (4) ◽  
pp. 797-806 ◽  
Author(s):  
Daniel Díaz-Pernil ◽  
Mario J. Pérez-Jiménez ◽  
Álvaro Romero-Jiménez

2011 ◽  
Vol 22 (01) ◽  
pp. 29-38 ◽  
Author(s):  
LINQIANG PAN ◽  
DANIEL DÍAZ-PERNIL ◽  
MARIO J. PÉREZ-JIMÉNEZ

Ramsey numbers deal with conditions when a combinatorial object necessarily contains some smaller given objects. It is well known that it is very difficult to obtain the values of Ramsey numbers. In this work, a theoretical chemical/biological solution is presented in terms of membrane computing for the decision version of Ramsey number problem, that is, to decide whether an integer n is the value of Ramsey number R(k, l), where k and l are integers.


Sign in / Sign up

Export Citation Format

Share Document