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
Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
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
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
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Morphic characterizations with insertion systems controlled by a context of length one
Theoretical Computer Science
Hi-index | 0.00 |
This article investigates insertion---deletion systems of small size, where at most two symbols can be used in the description of insertion or deletion rules in a context-free or contextual manner. The basic result shows a characterization by context-free grammars of insertion---deletion systems, which insert or delete one symbol in one symbol left context (systems of size (1, 1, 0; 1, 1, 0)). If context-free insertion or deletion rules are considered (systems of size (2, 0, 0; 1, 1, 0) or (1, 1, 0; 2, 0, 0)), then we show that corresponding systems are not computationally complete. However, if the insertion and the deletion operations having same size as above are considered in the distributed framework of P systems, then the computational power strictly increases and the obtained models become computationally complete. The article also shows that if context-free insertion and deletion rules of two symbols (of size (2, 0, 0; 2, 0, 0)) are used in combination with P systems, then the obtained model is still not computationally complete. Finally some open problems are presented.