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
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)
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
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 Insertion and Deletion Exo-Operations
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Matrix insertion-deletion systems
Theoretical Computer Science
Hi-index | 0.00 |
In this article we continue the investigation of insertion-deletion systems having a context only on one side of insertion or deletion rules. We show a counterpart of the results obtained in (Matveevici et al., 2007) by considering corresponding systems and exchanging deletion and insertion parameters. We prove three computational completeness results and one non-completeness result for these systems. We also solve the remaining open problem concerning the generative power of insertion-deletion systems having both contexts by proving the computational completeness of systems having a context-free insertion of two symbols and a contextual deletion of one symbol.