Opened Access Constant-Space P Systems with Active Membranes
Estadísticas
Icon
Exportar a
Autor: Leporati, Alberto
Manzoni, Luca
Mauri, Giancarlo
Porreca, Antonio E.
Zandron, Claudio
Fecha: 2014
Publicado en: 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,
ISBN/ISSN: 978-84-940056-4-0
Tipo de documento: Ponencia
Resumen: 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.
Tamaño: 313.7Kb
Formato: PDF

URI: http://hdl.handle.net/11441/33541

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones