Mostrar el registro sencillo del ítem
Ponencia
P Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete
dc.creator | Alhazov, Artiom | |
dc.creator | Freund, Rudolf | |
dc.date.accessioned | 2016-02-25T09:41:28Z | |
dc.date.available | 2016-02-25T09:41:28Z | |
dc.date.issued | 2005 | |
dc.identifier.isbn | 84-609-6771-9 | es |
dc.identifier.uri | http://hdl.handle.net/11441/36533 | |
dc.description.abstract | We consider P systems with only one membrane using symport/antiport rules and prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by using at most k + 4 symbols; hence, any recursively enumerable set of natural numbers can be generated (accepted) by using at most five symbols. | 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, 20-28. 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 | P Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete | 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/36533 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
bravol19.pdf | 170.4Kb | [PDF] | Ver/ | |