Information Sciences: an International Journal
Contextual insertions/deletions and computability
Information and Computation
Marcus Contextual Grammars
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Insertion and iterated insertion as operations on formal languages
Insertion and iterated insertion as operations on formal languages
On the computational power of insertion-deletion systems
Natural Computing: an international journal
Context-free insertion-deletion systems
Theoretical Computer Science - Descriptional complexity of formal systems
Regulated RNA rewriting: Modelling RNA editing with guided insertion
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
Insertion-deletion systems with one-sided contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
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
| Hi-index | 5.23 |
We investigate in this article the operations of insertion and deletion working in a matrix-controlled manner. We show that this allows to us strictly increase the computational power: in the case of systems that are not computationally complete (with total size equal to 4), the computational completeness can be obtained by introducing the matrix control and using only binary matrices.