P Systems with Minimal Left and Right Insertion and Deletion

dc.creator	Freund, Rudolf
dc.creator	Rogozhin, Yurii
dc.creator	Verlan, Sergey
dc.date.accessioned	2016-02-04T07:50:34Z
dc.date.available	2016-02-04T07:50:34Z
dc.date.issued	2012
dc.identifier.isbn	978-84-940056-5-7	es
dc.identifier.uri	http://hdl.handle.net/11441/34021
dc.description.abstract	In this article we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Tenth Brainstorming Week on Membrane Computing, 123-136. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2012,	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	P Systems with Minimal Left and Right Insertion and Deletion	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/34021

Ficheros	Tamaño	Formato	Ver	Descripción
RudiSerghei.pdf	119.3Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional