Graph-Controlled Insertion-Deletion Systems

@inproceedings{Freund2010GraphControlledIS,
  title={Graph-Controlled Insertion-Deletion Systems},
  author={Rudolf Freund and Marian Kogler and Yurii Rogozhin and Sergey Verlan},
  booktitle={DCFS},
  year={2010}
}
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. 

Sequential and graph controlled insertion-deletion systems

  • F. BashaSindhu J. Kumaar
  • Computer Science
    2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC)
  • 2016
It is found that sequential operation in contextual system characterizes non synchronized pure pattern language (NSPPL) and context free language (CFL), and a variant in the insertion-deletion system called graph controlled contextual insertion- deletion also enables to generate non synchronizedpure pattern language which helps to improve the computational complexity.

P Systems with Minimal Left and Right Insertion and Deletion

It is shown that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can even be achieved with the operations of left and right insertion and deletion of only one symbol.

Generating and accepting P systems with minimal left and right insertion and deletion

It is shown that using these operations in a P systems framework (which corresponds to using specific variants of graph control), computational completeness can be achieved with the operations of left and right insertion and deletion of only one symbol, both in the generating as well as in the accepting case.

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems

This work investigates which combinations of size parameters are sufficient to maintain the computational completeness of such restricted systems with the additional restriction that the control graph is a path, thus, these results also hold for ins-del P systems.

On path-controlled insertion–deletion systems

This paper investigates a variant of the main question in this area: which combinations of size parameters are sufficient to maintain computational completeness of restricted systems under the additional restriction that the (undirected) control graph is a path?

Matrix insertion-deletion systems

Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States

This article introduces extended rules, in which the contexts may be specified as regular expressions, instead of fixed words, and proves that leftist systems with such extended rules and two-state graph control can simulate any arbitrary 2-tag system.

Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion

This work shows for instance that matrix insertion-deletion systems with matrices of length two, insertion rules of type 1,i?ź1, i?Ż1 and context-free deletions are computationally complete and how to simulate Kleene stars of metalinear languages with several types of systems with very limited resources.

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems

It is shown that whenever GCID systems (with certain syntactical restrictions) describe all linear languages (LIN) with t components, they can extend this to GC ID systems with just one more component to describe, for instance, the concatenation of two languages from the language family that can be described as the Kleene closure of linear languages.

References

SHOWING 1-10 OF 24 REFERENCES

On minimal context-free insertion-deletion systems

It is shown that if the length of the inserted/deleted string is bounded to two, then the obtained systems are not universal and a new complexity measure is introduced for insertion-deletion systems, which permits a better explanation of the obtained results.

Further Results on Insertion-Deletion Systems with One-Sided Contexts

The remaining open problem concerning the generative power of insertion-deletion systems having both contexts is solved by proving the computational completeness of systems having a context-free insertion of two symbols and a contextual deletion of one symbol.

Computational Power of P Systems with Small Size Insertion and Deletion Rules

This article takes two insertion-deletion systems that are not computationally complete, considers them in the framework of P systems and shows that the computational power is strictly increased by proving that any recursively enumerable language can be generated.

Insertion-Deletion Systems

This chapter considers computing models based on two operations — insertion and deletion, with context dependence, which were already considered in formal language theory, mainly with motivation from linguistics.

Computational power of insertion–deletion (P) systems with rules of size two

If context-free insertion and deletion rules of two symbols are used in combination with P systems, then the obtained model is still not computationally complete, but if the insertion and the deletion operations having same size are considered in the distributed framework of P systems then the computational power strictly increases and the obtained models become Computationally complete.

Insertion and iterated insertion as operations on formal languages

The operations of insertion ((<---)) and iterated insertion ((<---)*) are simple variants of Kleene's operations (.) and (,*) ({Kle 56}) in a manner similar to the operations shuffle and iterated

On the computational power of insertion-deletion systems

The generative power of insertion-deletion systems (InsDel systems) is investigated, and it is shown that the family INS11DEL11 is equal to the family of recursively enumerable languages.

Circular contextual insertions/deletions with applications to biomolecular computation

  • Mark DaleyL. KariG. GloorR. Siromoney
  • Biology, Computer Science
    6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)
  • 1999
A new model for DNA-based computation that involves circular as well as linear molecules, and that uses the operations of insertion and deletion, is presented and it is proved that the circular insertion/deletion systems are capable of universal computation.