Repositorio de producción científica de la Universidad de Sevilla

On the Power of Insertion P Systems of Small Size


Advanced Search

Show simple item record

dc.creator Krassovitskiy, Alexander 2016-03-22T08:29:15Z 2016-03-22T08:29:15Z 2009
dc.identifier.isbn 9788461328369 es
dc.description.abstract In this article we investigate insertion systems of small size in the framework of P systems. We consider P systems with insertion rules having one symbol context and we show that they have the computational power of matrix grammars. If contexts of length two are permitted, then any recursively enumerable language can be generated. In both cases an inverse morphism and a weak coding were applied to the output of the corresponding P systems. 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.II, 29-43. 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 *
dc.title On the Power of Insertion P Systems of Small Size 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
Size: 180.9Kb
Format: PDF

This item appears in the following Collection(s)

Show simple item record