Giessener Elektronische Bibliothek

GEB - Giessener Elektronische Bibliothek

String assembling systems

Kutrib, Martin ; Wendlandt, Matthias


Originalveröffentlichung: (2012) RAIRO - Theoretical Informatics and Applications 46(04):593-613 doi: 10.1051/ita/2012020
Zum Volltext im pdf-Format: Dokument 1.pdf (222 KB)


Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende
URN: urn:nbn:de:hebis:26-opus-98900
URL: http://geb.uni-giessen.de/geb/volltexte/2013/9890/

Bookmark bei Connotea Bookmark bei del.icio.us


Sammlung: Allianzlizenzen / Artikel
Universität Justus-Liebig-Universität Gießen
Institut: Institut für Informatik
Fachgebiet: Informatik
DDC-Sachgruppe: Informatik
Dokumentart: Aufsatz
Sprache: Englisch
Erstellungsjahr: 2012
Publikationsdatum: 10.07.2013
Kurzfassung auf Englisch: We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set 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, and at the end of the assembling process. We start to explore the generative capacity of string assembling systems. In particular, we prove that any such system can be simulated by some nondeterministic one-way two-head finite automaton, while the stateless version of the two-head finite automaton marks to some extent a lower bound for the generative capacity. Moreover, we obtain several incomparability and undecidability results as well as (non-)closure properties, and present questions for further investigations.
Lizenz: Allianzlizenz