Contextual insertions/deletions and computability
Information and Computation
Characterizations of recursively enumerable languages by means of insertion grammars
Theoretical Computer Science
Marcus Contextual Grammars
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
On the Computational Power of Insertion-Deletion Systems
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Further Results on Insertion-Deletion Systems with One-Sided Contexts
Language and Automata Theory and Applications
On minimal context-free insertion-deletion systems
Journal of Automata, Languages and Combinatorics
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
P systems with minimal insertion and deletion
Theoretical Computer Science
Computational power of insertion---deletion (P) systems with rules of size two
Natural Computing: an international journal
Circular post machines and p systems with exo-insertion and deletion
CMC'11 Proceedings of the 12th international conference on Membrane Computing
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Hi-index | 0.00 |
It is known that insertion-deletion (P) systems with two symbols context-free insertion and deletion rules are not computationally complete. It is thus interesting to consider conditions that would allow such systems to reach computational completeness. In this paper we consider insertion-deletion P systems with insertion and deletion operations applied only at the ends of string (we call them exo-operations). We show that such systems with one-symbol insertion and deletion of up to two symbols are computationally complete, and so are systems with insertion of up to two symbols and one-symbol deletion. The question about the computational power of insertion-deletion P systems with one-symbol insertion and one-symbol deletion operations applied at the ends of string is open. However, the tissue P systems reach computationally completeness even in this case.