We study properties of string operations motivated by the gene assembly process of ciliates. We examine the effect of these operations applied to finite multisets of words which make it possible to study not only sequential, but also different types of parallel derivation strategies. We compare the classes of finite languages which can be obtained by the different strategies, and show that although the string operations we consider are reversible, their parallel application can produce effects resembling the irreversibility of the biological process of gene assembly in ciliates.
Keywords: Theoretical DNA computing, ciliates, finite languages
