Graph-Controlled Insertion-Deletion Systems

Details Graph-Controlled Insertion-Deletion Systems Graph-Controlled Insertion-Deletion Systems

2010-08-10

arxiv.org/abs/1008.1651v1

EPTCS 31, 2010, pp. 88-98

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.11

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.

Affiliated with

Also associated with

No associations

Rating

Graph-Controlled Insertion-Deletion Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph-Controlled Insertion-Deletion Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph-Controlled Insertion-Deletion Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583259