Opened Access On Very Simple P Colonies
Estadísticas
Icon
Exportar a
Autor: Ciencialová, Lucie
Csuhaj Varjú, Erzsébet
Kelemenová, Alice
Vaszil, György
Fecha: 2009
Publicado en: Proceedings of the Seventh Brainstorming Week on Membrane Computing, vol.I, 97-108. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2009
ISBN/ISSN: 9788461328369
Tipo de documento: Ponencia
Resumen: We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these extremely simple types of systems are able to compute any recursively enumerable set of vectors of non-negative integers.
Tamaño: 168.8Kb
Formato: PDF

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

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