String Assembling Systems

Kutrib, Martin, and Wendlandt, Matthias. "String Assembling Systems." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 46.4 (2012): 593-613. <http://eudml.org/doc/272991>.

@article{Kutrib2012,
abstract = {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.},
author = {Kutrib, Martin, Wendlandt, Matthias},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {string assembling; double-stranded sequences; stateless; two-head finite automata; decidability; closure properties; string assembling systems; double-stranded sequence of symbols; piecewise assembly; nondeterministic one-way two-head finite automata},
language = {eng},
number = {4},
pages = {593-613},
publisher = {EDP-Sciences},
title = {String Assembling Systems},
url = {http://eudml.org/doc/272991},
volume = {46},
year = {2012},
}

TY - JOUR
AU - Kutrib, Martin
AU - Wendlandt, Matthias
TI - String Assembling Systems
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2012
PB - EDP-Sciences
VL - 46
IS - 4
SP - 593
EP - 613
AB - 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.
LA - eng
KW - string assembling; double-stranded sequences; stateless; two-head finite automata; decidability; closure properties; string assembling systems; double-stranded sequence of symbols; piecewise assembly; nondeterministic one-way two-head finite automata
UR - http://eudml.org/doc/272991
ER -