Mostrar el registro sencillo del ítem
Ponencia
Automaton-like P Colonies
dc.creator | Cienciala, Ludek | |
dc.creator | Ciencialová, Lucie | |
dc.creator | Csuhaj Varjú, Erzsébet | |
dc.date.accessioned | 2016-01-21T10:17:33Z | |
dc.date.available | 2016-01-21T10:17:33Z | |
dc.date.issued | 2015 | |
dc.identifier.isbn | 978-84-944366-2-8 | es |
dc.identifier.uri | http://hdl.handle.net/11441/33022 | |
dc.description.abstract | In this paper we study P colonies where the environment is given as a string. These variants, called automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. We develop the concept of APCol systems by introducing the notion of their generating working mode. We then compare the power of APCol systems working in the generating mode and that of register machines and context-free matrix grammars with and without appearance checking. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Fénix Editora | es |
dc.relation.ispartof | Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, 105-120. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2015, | es |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | String processing | es |
dc.subject | P Colonies | es |
dc.subject | computational power | es |
dc.title | Automaton-like 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/33022 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
105_bwmc2015-ccc.pdf | 292.0Kb | [PDF] | Ver/ | |