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

Krassovitskiy, Alexander; Rogozhin, Yurii; Verlan, Sergey

doi:10.4204/eptcs.1.10

Cited by 7 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar investigations were continued in [17,12,13] on insertion-deletion systems with one-sided contexts, i.e., where the context dependency is present only from the left or only from the right side of all insertion and deletion rules. The papers cited above give several computational completeness results depending on the size of insertion and deletion rules.…”

Section: Introductionmentioning

confidence: 81%

Matrix insertion–deletion systems

Petre

Verlan²

2012

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly increased when using a matrix control: 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 using only binary matrices.

show abstract

Section: Introductionmentioning

confidence: 81%

Matrix insertion–deletion systems

Petre

Verlan²

2012

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Similar investigations were continued in [16,11,12] on insertion-deletion systems with one-sided contexts, i.e., where the context dependency is present only from the left or only from the right side of all insertion and deletion rules. The papers cited above give several computational completeness results depending on the size of insertion and deletion rules.…”

Section: Introductionmentioning

confidence: 81%

Graph-Controlled Insertion-Deletion Systems

Freund¹,

Kogler²,

Rogozhin³

et al. 2010

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

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

show abstract

“…Similar investigations were continued in [20,15,16] on insertion-deletion systems with one-sided contexts, i.e., where the context dependency is asymmetric and is present only from the left or only from the right side of all insertion and deletion rules. The papers cited above give several computational completeness results depending on the size of insertion and deletion rules.…”

Section: Introductionmentioning

confidence: 79%

Random Context and Semi-conditional Insertion-deletion Systems

Ivanov

Verlan

2015

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

In this article we introduce the operations of insertion and deletion working in a random-context and semi-conditional manner. We show that the conditional use of rules strictly increase the computational power. In the case of semi-conditional insertion-deletion systems context-free insertion and deletion rules of one symbol are sufficient to get the computational completeness. In the random context case our results expose an asymmetry between the computational power of insertion and deletion rules: systems of size (2, 0, 0; 1, 1, 0) are computationally complete, while systems of size (1, 1, 0; 2, 0, 0) (and more generally of size (1, 1, 0; p, 1, 1)) are not. This is particularly interesting because other control mechanisms like graph-control or matrix control used together with insertion-deletion systems do not present such asymmetry.

show abstract

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

Cited by 7 publications

References 10 publications

Matrix insertion–deletion systems

Matrix insertion–deletion systems

Graph-Controlled Insertion-Deletion Systems

Random Context and Semi-conditional Insertion-deletion Systems

Contact Info

Product

Resources

About