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
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
Computing with Cells: Advances in Membrane Computing
Computing with Cells: Advances in Membrane Computing
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Computational power of two stacks with restricted communication
Information and Computation
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
P Systems with Insertion and Deletion Exo-Operations
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
This paper focuses on P systems with one-symbol insertion and deletion without contexts. The main aim of this paper is to consider the operations applied at the ends of the string, and prove the computational completeness in case of priority of deletion over insertion. This result presents interest since the strings are controlled by a tree structure only, and because insertion and deletion of one symbol are the simplest string operations. To obtain a simple proof, we introduce here a new variant (CPM5) of circular Post machines (Turing machines moving one-way on a circular tape): those with instructions changing a state and either reading one symbol or writing one symbol. We believe CPM5 deserves attention as a simple, yet useful tool. In the last part of the paper, we return to the case without priorities. We give a lower bound on the power of such systems, which holds even for one-sided operations only.