Contextual insertions/deletions and computability
Information and Computation
Characterizations of recursively enumerable languages by means of insertion grammars
Theoretical Computer Science
Theory of Computation: A Primer
Theory of Computation: A Primer
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
Computation: finite and infinite machines
Computation: finite and infinite machines
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
On minimal context-free insertion-deletion systems
Journal of Automata, Languages and Combinatorics
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 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
| Hi-index | 5.23 |
In this paper, we consider insertion-deletion P systems with priority of deletion over insertion. We show that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE). If a one-symbol one-sided context is added to the insertion or deletion rules, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important, and in its absence the corresponding class of P systems is strictly included in the family of matrix languages (MAT).