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)
Further Results on Insertion-Deletion Systems with One-Sided Contexts
Language and Automata Theory and Applications
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
P systems with minimal insertion and deletion
Theoretical Computer Science
Matrix insertion-deletion systems for bio-molecular structures
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Computational power of insertion---deletion (P) systems with rules of size two
Natural Computing: an international journal
About complete obligatory hybrid networks of evolutionary processors without substitution
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
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 |
We investigate the class of context-free insertion-deletion systems. It is known that such systems are universal if the length of the inserted/deleted string is at least three. We show that if this length is bounded to two, then the obtained systems are not universal. We characterise the obtained class and we introduce a new complexity measure for insertion-deletion systems, which permits a better explanation of the obtained results.