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

On the Power of Insertion P Systems of Small Size

Opened Access On the Power of Insertion P Systems of Small Size
Estadísticas
Icon
Exportar a
Autor: Krassovitskiy, Alexander
Fecha: 2009
Publicado en: 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
ISBN/ISSN: 9788461328369
Tipo de documento: Ponencia
Resumen: 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.
Tamaño: 180.9Kb
Formato: PDF

URI: http://hdl.handle.net/11441/38901

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones