Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1051/ita/2013048 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | Field | DocType |
String assembling,double-stranded sequences,concatenation hierarchy,stateless,multi-head finite automata,closure properties | Combinatorics,Unary operation,Concatenation,Generative grammar,Regular language,Hierarchy,Stateless protocol,Piecewise,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 1 | 0988-3754 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Kutrib | 1 | 778 | 89.77 |
| Matthias Wendlandt | 2 | 32 | 14.13 |