Opened Access On Controlled P Systems
Estadísticas
Icon
Exportar a
Autor: Krithivasan, Kamala
Paun, Gheorghe
Ramanujan, Ajeesh
Fecha: 2013
Publicado en: Proceedings of the Eleventh Brainstorming Week on Membrane Computing, 137-152. Sevilla, E.T.S. de Ingeniería Informática, 4-8 de Febrero, 2013,
ISBN/ISSN: 978-84-940691-9-2
Tipo de documento: Ponencia
Resumen: We introduce and brie y investigate P systems with controlled computations. First, P systems with label restricted transitions are considered (in each step, all rules used have either the same label, or, possibly, the empty label, ), then P systems with the computations controlled by languages (as in context-free controlled grammars). The relationships between the families of sets of numbers computed by the various classes of controlled P systems are investigated, also comparing them with length sets of languages in Chomsky and Lindenmayer hierarchies (characterizations of the length sets of ET0L and of recursively enumerable languages are obtained in this framework). A series of open problems and research topics are formulated.
Tamaño: 274.4Kb
Formato: PDF

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

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