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 …

Insertion and deletion are operations that occur commonly in DNA processing and RNA
editing. Since biological macromolecules can be viewed as symbols, gene sequences can …

A graph-controlled insertion–deletion system is a regulated extension of an insertion–
deletion system. It has several components and each component contains some insertion …

A graph-controlled insertion–deletion (GCID) system is a regulated extension of an insertion–
deletion system. Such a system has several components and each component has some …

Matrix insertion-deletion systems combine the idea of matrix control (a control mechanism
well established in regulated rewriting) with that of insertion and deletion (as opposed to …

In recent years, the modeling interest has increased significantly from molecular level to
atomic and quantum levels. Computational chemistry plays a significant role in designing …

A matrix insertion-deletion system (or matrix ins-del system) is described by a set of insertion-
deletion rules presented in matrix form, which demands all rules of a matrix to be applied in …

We consider graph-controlled insertion-deletion systems and prove that the systems with
sizes (i)(3; 1, 1, 1; 1, 0, 1),(ii)(3; 1, 1, 1; 1, 1, 0) and (iii)(2; 2, 0, 0; 1, 1, 1) are computationally …

In this paper, we show that pure insertion grammars of size 2 (ie, inserting two symbols in a
left and right context, each consisting of two symbols) can characterize all recursively …

Quantum finite automata (QFA) play a crucial role in quantum information processing theory.
The representation of ribonucleic acid (RNA) and deoxyribonucleic acid (DNA) structures …