Show simple item record

Presentation

dc.creatorAlhazov, Artiom
dc.creatorKrassovitskiy, Alexander
dc.creatorRogozhin, Yurii
dc.creatorVerlan, Sergey
dc.date.accessioned2016-03-18T11:07:58Z
dc.date.available2016-03-18T11:07:58Z
dc.date.issued2009
dc.identifier.isbn9788461328369es
dc.identifier.urihttp://hdl.handle.net/11441/38817
dc.description.abstractIn 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.formatapplication/pdfes
dc.language.isoenges
dc.publisherFénix Editoraes
dc.relation.ispartofProceedings 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, 2009es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleP Systems with Minimal Insertion and Deletiones
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.identifier.idushttps://idus.us.es/xmlui/handle/11441/38817

FilesSizeFormatViewDescription
07_ArtiomInsDel.pdf219.9KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional