Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations

dc.creator	Alhazov, Artiom
dc.date.accessioned	2016-02-25T09:05:51Z
dc.date.available	2016-02-25T09:05:51Z
dc.date.issued	2005
dc.identifier.isbn	84-609-6771-9	es
dc.identifier.uri	http://hdl.handle.net/11441/36530
dc.description.abstract	The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing the configuration space by following transitions like following hyperlinks in the World-Wide Web. The relationships of maximally parallel multiset-rewriting systems with other rewriting systems are investigated, such as Petri nets, different kinds of P systems, Lindenmayer systems, grammar systems, regulated grammars.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Third Brainstorming Week on Membrane Computing, 1-10. Sevilla, E.T.S. de Ingeniería Informática, 31 de Enero-4 de Febrero, 2005,	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations	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/36530

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

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