Mostrar el registro sencillo del ítem
Ponencia
On Very Simple P Colonies
dc.creator | Ciencialová, Lucie | |
dc.creator | Csuhaj Varjú, Erzsébet | |
dc.creator | Kelemenová, Alice | |
dc.creator | Vaszil, György | |
dc.date.accessioned | 2016-03-21T08:37:46Z | |
dc.date.available | 2016-03-21T08:37:46Z | |
dc.date.issued | 2009 | |
dc.identifier.isbn | 9788461328369 | es |
dc.identifier.uri | http://hdl.handle.net/11441/38858 | |
dc.description.abstract | We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these extremely simple types of systems are able to compute any recursively enumerable set of vectors of non-negative integers. | 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.I, 97-108. 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 Very Simple P Colonies | 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/38858 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
14_Gyuri.pdf | 168.8Kb | [PDF] | Ver/ | |