Mostrar el registro sencillo del ítem
Ponencia
Standardized Proofs of PSPACE-completeness of P Systems with Active Membranes
dc.creator | Sosík, Petr | es |
dc.creator | Rodríguez Patón, Alfonso | es |
dc.creator | Ciencialová, Lucie | es |
dc.date.accessioned | 2016-03-30T09:46:44Z | |
dc.date.available | 2016-03-30T09:46:44Z | |
dc.date.issued | 2010 | |
dc.identifier.isbn | 9788461423576 | es |
dc.identifier.uri | http://hdl.handle.net/11441/39139 | |
dc.description.abstract | Two proofs have been shown for P systems with active membranes in previ- ously published papers, demonstrating that these P systems can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are equivalent (up to a polynomial time reduction) to Second Machine Class models as the alternating Turing machine or the PRAM computer. These proofs were based on a modified definition of uniform families of P systems. Here we demonstrate that the results remain valid also in the case of standard definitions. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Eighth Brainstorming Week on Membrane Computing, 301-310. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010 | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Standardized Proofs of PSPACE-completeness of P Systems with Active Membranes | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/39139 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
23P_activ.pdf | 172.2Kb | [PDF] | Ver/ | |