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

Covering Rules in P Systems: Some Preliminary Ideas

Opened Access Covering Rules in P Systems: Some Preliminary Ideas
Estadísticas
Icon
Exportar a
Autor: Sempere, José M.
Fecha: 2004
Publicado en: Proceedings of the Second Brainstorming Week on Membrane Computing, 449-456. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004
ISBN/ISSN: 84-688-6101-4
Tipo de documento: Ponencia
Resumen: In this paper we propose a new kind of rules inside the regions of a P system. We have called them covering rules due to the fact that, if selected, they can manage all the objects of the region in an exhaustive manner (i.e., they cover all the objects of the region). First, we propose the formal definition of the rules and different ways of using them. This will introduce a second degree of nondeterminism in the complete behavior of a given P system. We will introduce an effective way to reduce the nondeterminism by defining indexed covering rules. Finally, we will initiate a study of several language families characterized in terms of the covering rules language families.
Tamaño: 147.1Kb
Formato: PDF

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

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