Mostrar el registro sencillo del ítem

dc.creator Alhazov, Artiom
dc.creator Krassovitskiy, Alexander
dc.creator Rogozhin, Yurii
dc.creator Verlan, Sergey
dc.date.accessioned 2016-03-18T11:07:58Z
dc.date.available 2016-03-18T11:07:58Z
dc.date.issued 2009
dc.identifier.isbn 9788461328369 es
dc.identifier.uri http://hdl.handle.net/11441/38817
dc.description.abstract In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol one-sided context is added to insertion or deletion rules but no priority is considered, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important and in its absence the corresponding class of P systems is strictly included in MAT. 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, 9-21. 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 P Systems with Minimal Insertion and Deletion 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/38817
Tamaño: 219.9Kb
Formato: PDF

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem