Mostrar el registro sencillo del ítem
Ponencia
Decidability of Divergence for Catalytic P Systems
dc.creator | Busi, Nadia | |
dc.date.accessioned | 2016-03-08T08:34:29Z | |
dc.date.available | 2016-03-08T08:34:29Z | |
dc.date.issued | 2006 | |
dc.identifier.isbn | 8461106814 | es |
dc.identifier.uri | http://hdl.handle.net/11441/36992 | |
dc.description.abstract | P systems are a biologically inspired model introduced by Gheorghe P¸aun with the aim of representing the structure and the functioning of the cell. Since their introduction, several variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems without priorities associated to the rules. We show that the divergence problem (i.e., checking for the existence of an infinite computation) is decidable in such a class of P systems. As a corollary, we obtain an alternative proof of the nonuniversality of deterministic catalytic P systems, an open problem recently solved by Ibarra and Yen. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Fourth Brainstorming Week on Membrane Computing, Vol.I, 63-79. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2006 | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Decidability of Divergence for Catalytic 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/36992 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
nadiaf.pdf | 220.0Kb | ![]() | Ver/ | |