Ponencia
On the Power of Insertion P Systems of Small Size
Autor/es | Krassovitskiy, Alexander |
Fecha de publicación | 2009 |
Fecha de depósito | 2016-03-22 |
Publicado en |
|
ISBN/ISSN | 9788461328369 |
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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
07_krassov.pdf | 180.9Kb | [PDF] | Ver/ | |