Show simple item record

Presentation

dc.creatorLeporati, Alberto
dc.creatorManzoni, Luca
dc.creatorMauri, Giancarlo
dc.creatorPorreca, Antonio E.
dc.creatorZandron, Claudio
dc.date.accessioned2016-01-29T06:54:47Z
dc.date.available2016-01-29T06:54:47Z
dc.date.issued2014
dc.identifier.isbn978-84-940056-4-0es
dc.identifier.urihttp://hdl.handle.net/11441/33541
dc.description.abstractWe 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.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings 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.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleConstant-Space P Systems with Active Membraneses
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/33541

FilesSizeFormatViewDescription
243_Paper.pdf313.7KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional