Mostrar el registro sencillo del ítem
Ponencia
Monodirectional P Systems
dc.creator | Leporati, Alberto | |
dc.creator | Manzoni, Luca | |
dc.creator | Mauri, Giancarlo | |
dc.creator | Porreca, Antonio E. | |
dc.creator | Zandron, Claudio | |
dc.date.accessioned | 2016-01-22T06:17:08Z | |
dc.date.available | 2016-01-22T06:17:08Z | |
dc.date.issued | 2015 | |
dc.identifier.isbn | 978-84-944366-2-8 | es |
dc.identifier.uri | http://hdl.handle.net/11441/33106 | |
dc.description.abstract | We investigate the in uence that the ow of information in membrane systems has on their computational complexity. In particular, we analyse the behaviour of P systems with active membranes where communication only happens from a membrane towards its parent, and never in the opposite direction. We prove that these \monodirectional P systems" are, when working in polynomial time and under standard complexity-theoretic assumptions, much less powerful than unrestricted ones: indeed, they characterise classes of problems de ned by polynomial-time Turing machines with NP oracles, rather than the whole class PSPACE of problems solvable in polynomial space. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, 207-226. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2015, | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Monodirectional P Systems | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/33106 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
207_Paper.pdf | 366.9Kb | [PDF] | Ver/ | |