Mostrar el registro sencillo del ítem
Ponencia
Constant-Space P Systems with Active Membranes
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-29T06:54:47Z | |
dc.date.available | 2016-01-29T06:54:47Z | |
dc.date.issued | 2014 | |
dc.identifier.isbn | 978-84-940056-4-0 | es |
dc.identifier.uri | http://hdl.handle.net/11441/33541 | |
dc.description.abstract | We continue the investigation of the computational power of space- constrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative de nition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken into ac- count. Finally, we prove that, when less than a logarithmic number of membrane labels is available, moving the input objects around the membrane structure without rewriting them is not enough to even distinguish inputs of the same length. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Twelfth Brainstorming Week on Membrane Computing, 243-260. Sevilla, E.T.S. de Ingeniería Informática, 3-7 de Febrero, 2014, | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Constant-Space 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/33541 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
243_Paper.pdf | 313.7Kb | [PDF] | Ver/ | |