RAIRO-Theor. Inf. Appl.
Volume 48, Number 1, January-March 2014Non-Classical Models of Automata and Applications (NCMA 2012)
|Page(s)||39 - 59|
|Published online||20 January 2014|
Bidirectional string assembling systems
Accepted: 11 December 2013
We introduce and investigate several variants of a bidirectional string assembling system, which is a computational model that generates strings from copies of assembly units. The underlying mechanism is based on two-sided piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that bidirectional string assembling system generate languages not represented as any finite concatenation of one-sided string assembling systems. The latter build an infinite, strict and tight concatenation hierarchy. Moreover, it is shown that even the strongest system in question can only generate NL languages, while there are unary regular languages that cannot be derived. Furthermore, a finite strict hierarchy with respect to the different variants considered is shown and closure properties of the languages generated are presented.
Mathematics Subject Classification: 68Q05 / 68Q42
Key words: String assembling / double-stranded sequences / concatenation hierarchy / stateless / multi-head finite automata / closure properties
© EDP Sciences 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.