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
DNA Computing: New Computing Paradigms
DNA Computing: New Computing Paradigms
Note: On the weight of universal insertion grammars
Theoretical Computer Science
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
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
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
On the power of networks of evolutionary processors
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
P systems with minimal insertion and deletion
Theoretical Computer Science
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
Information and Computation
Computational power of insertion---deletion (P) systems with rules of size two
Natural Computing: an international journal
Complexity of guided insertion-deletion in RNA-Editing
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
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
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On Insertion Grammars with Maximum Parallel Derivation
Fundamenta Informaticae
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 consider a class of insertion-deletion systems which have not been investigated so far, those without any context controlling the insertion-deletion operations. Rather unexpectedly, we found that context-free insertion-deletion systems characterize the recursively enumerable languages. Moreover, this assertion is valid for systems with only one axiom, and also using inserted and deleted strings of a small length. As direct consequences of the main result we found that set-conditional insertion-deletion systems with two axioms generate any recursively enumerable language (this solves an open problem), as well as that membrane systems with one membrane having context-free insertion-deleletion rules without conditional use of them generate all recursively enumerable languages (this improves an earlier result). Some open problems are also formulated.