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

dP Automata versus Right-Linear Simple Matrix Grammars

 

Advanced Search
 
Opened Access dP Automata versus Right-Linear Simple Matrix Grammars
Cites
Show item statistics
Icon
Export to
Author: Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2011
Published in: Proceedings of the Ninth Brainstorming Week on Membrane Computing, 293-304. Sevilla, E.T.S. de Ingeniería Informática, 31 de enero-4 de febrero, 2011
ISBN/ISSN: 9788461518371
Document type: Presentation
Abstract: We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.
Size: 201.9Kb
Format: PDF

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

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)