Improving the Universality Results of Enzymatic Numerical P Systems

dc.creator	Vasile, Cristian Ioan
dc.creator	Pavel, Ana Brandusa
dc.creator	Dumitrache, Ioan
dc.date.accessioned	2016-02-05T07:49:13Z
dc.date.available	2016-02-05T07:49:13Z
dc.date.issued	2012
dc.identifier.isbn	978-84-940056-6-4	es
dc.identifier.uri	http://hdl.handle.net/11441/34150
dc.description.abstract	This paper provides the proof that Enzymatic Numerical P Sytems with deterministic, but parallel, execution model are universal, even when the production functions used are polynomials of degree 1. This extends previous known results and provides the optimal case in terms of polynomial degree.	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, (2)207-214. 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	Improving the Universality Results of Enzymatic Numerical P Systems	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/34150

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

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