Ponencia
dP Automata versus Right-Linear Simple Matrix Grammars
Autor/es | Paun, Gheorghe
Pérez Jiménez, Mario de Jesús |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2011 |
Fecha de depósito | 2016-04-06 |
Publicado en |
|
ISBN/ISSN | 9788461518371 |
Resumen | 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 ... 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. |
Agencias financiadoras | Junta de Andalucía |
Identificador del proyecto | P08 – TIC 04200 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
21dPsystemsCris.pdf | 201.9Kb | [PDF] | Ver/ | |