On the Power of Insertion P Systems of Small Size

dc.creator	Krassovitskiy, Alexander
dc.date.accessioned	2016-03-22T08:29:15Z
dc.date.available	2016-03-22T08:29:15Z
dc.date.issued	2009
dc.identifier.isbn	9788461328369	es
dc.identifier.uri	http://hdl.handle.net/11441/38901
dc.description.abstract	In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of matrix grammars. If contexts of length two are permitted, then any recursively enumerable language can be generated. In both cases an inverse morphism and a weak coding were applied to the output of the corresponding P systems.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Seventh Brainstorming Week on Membrane Computing, vol.II, 29-43. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2009	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	On the Power of Insertion P Systems of Small Size	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/38901

Ficheros	Tamaño	Formato	Ver	Descripción
07_krassov.pdf	180.9Kb	[PDF]	Ver/Abrir

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