Graph-Controlled Insertion-Deletion Systems
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a contextual or in a context-free manner and with the control graph having only four nodes.
Keywords
Cite
@article{arxiv.1008.1651,
title = {Graph-Controlled Insertion-Deletion Systems},
author = {Rudolf Freund and Marian Kogler and Yurii Rogozhin and Sergey Verlan},
journal= {arXiv preprint arXiv:1008.1651},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270