Presentation
dP Automata versus Right-Linear Simple Matrix Grammars
Author/s | Paun, Gheorghe
Pérez Jiménez, Mario de Jesús |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2011 |
Deposit Date | 2016-04-06 |
Published in |
|
ISBN/ISSN | 9788461518371 |
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 ... 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. |
Funding agencies | Junta de Andalucía |
Project ID. | P08 – TIC 04200 |
Files | Size | Format | View | Description |
---|---|---|---|---|
21dPsystemsCris.pdf | 201.9Kb | [PDF] | View/ | |