Complexity and modeling power of insertion-deletion systems
COMPLEXITY AND MODELING POWER OF INSERTION-DELETION SYSTEMS The central object of the thesis are insertion-deletion systems and their computational power. More specifically, we study language generating models that use two string rewriting operations: contextual insertion and contextual deletion, an...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universitat Rovira i virgili (URV) |
| Repositorio: | Repositori Institucional de la Universitat Rovira i Virgili |
| OAI Identifier: | oai:urv.cat:TDX:987 |
| Acceso en línea: | https://hdl.handle.net/20.500.11797/TDX987 http://hdl.handle.net/10803/48631 |
| Access Level: | acceso abierto |
| Palabra clave: | 51 - Matemàtiques 004 - Informàtica |
| Sumario: | COMPLEXITY AND MODELING POWER OF INSERTION-DELETION SYSTEMS The central object of the thesis are insertion-deletion systems and their computational power. More specifically, we study language generating models that use two string rewriting operations: contextual insertion and contextual deletion, and their extensions. We also consider a distributed variant of insertion-deletion systems in the sense that rules are separated among a finite number of nodes of a graph. Such systems are refereed as graph-controlled systems. These systems appear in many areas of Computer Science and they play an important role in formal languages, linguistics, and bio-informatics. We vary the parameters of the vector of size of insertion-deletion systems and we study decidability/universality of obtained models. More precisely, we answer the most important questions regarding the expressiveness of the computational model: whether our model is Turing equivalent or not. We systematically approach the questions about the minimal sizes of the insertiondeletion systems with and without the graph-control. |
|---|