Journal article

Publication year: 2024

Pages: 131-156

Journal: Natural Computing

Volume number: 23

Issue number: 1

ISSN: 1567-7818

eISSN: 1572-9796

Open access status: Hybrid

DOI Link: https://doi.org/10.1007/s11047-022-09918-x

Publisher: Springer

Abstract: 
String assembling systems are biologically inspired mechanisms that generate strings from copies out of finite sets of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction of assembly units that may appear at the beginning, during, or at the end of the assembling process and by a length restriction on the units. We investigate the power of these model-inherent control mechanisms by considering variants where one or more of these mechanisms are relaxed. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that the power gained in the different control mechanisms may yield strictly more powerful systems and incomparable capacities. Additionally, we generalize these systems to multi-stranded systems. We obtain a strong connection to one-way multi-head finite automata and show an infinite, dense, and strict strand hierarchy. Finally, we examine the closure properties of the different variants of string assembling systems.

Harvard Citation style: Kutrib, M. and Wendlandt, M. (2024) Variants of string assembling systems, Natural Computing, 23(1), pp. 131-156. https://doi.org/10.1007/s11047-022-09918-x

APA Citation style: Kutrib, M., & Wendlandt, M. (2024). Variants of string assembling systems. Natural Computing. 23(1), 131-156. https://doi.org/10.1007/s11047-022-09918-x