(Ultimately Confluent) Parallel Multiset-Rewriting Systems with Context

dc.creator	Alhazov, Artiom
dc.creator	Sburlan, Dragos
dc.date.accessioned	2016-02-11T10:12:30Z
dc.date.available	2016-02-11T10:12:30Z
dc.date.issued	2004
dc.identifier.isbn	84-688-6101-4	es
dc.identifier.uri	http://hdl.handle.net/11441/34553
dc.description.abstract	The aim of this paper is to study the power of parallel multiset- rewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satis¯es a special property we de¯ne: it is ulti- mately con°uent. This means that if the system allows at least one halting computation, then its ¯nal con¯guration is reachable from any reachable con- ¯guration.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Second Brainstorming Week on Membrane Computing, 45-52. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	(Ultimately Confluent) Parallel Multiset-Rewriting Systems with Context	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/34553

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

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