# Bidirectional string assembling systems

Martin Kutrib; Matthias Wendlandt

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2014)

- Volume: 48, Issue: 1, page 39-59
- ISSN: 0988-3754

## Access Full Article

top## Abstract

top## How to cite

topKutrib, Martin, and Wendlandt, Matthias. "Bidirectional string assembling systems." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 48.1 (2014): 39-59. <http://eudml.org/doc/273052>.

@article{Kutrib2014,

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.},

author = {Kutrib, Martin, Wendlandt, Matthias},

journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},

keywords = {string assembling; double-stranded sequences; concatenation hierarchy; stateless; multi-head finite automata; closure properties},

language = {eng},

number = {1},

pages = {39-59},

publisher = {EDP-Sciences},

title = {Bidirectional string assembling systems},

url = {http://eudml.org/doc/273052},

volume = {48},

year = {2014},

}

TY - JOUR

AU - Kutrib, Martin

AU - Wendlandt, Matthias

TI - Bidirectional string assembling systems

JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

PY - 2014

PB - EDP-Sciences

VL - 48

IS - 1

SP - 39

EP - 59

AB - 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.

LA - eng

KW - string assembling; double-stranded sequences; concatenation hierarchy; stateless; multi-head finite automata; closure properties

UR - http://eudml.org/doc/273052

ER -

## References

top- [1] R. Freund, G. Păun, G. Rozenberg and A. Salomaa, Bidirectional sticker systems, in Pacific Symposium on Biocomputing (PSB 1998). World Scientific, Singapore (1998) 535–546.
- [2] J. Hartmanis, On non-determinancy in simple computing devices. Acta Inform.1 (1972) 336–344. Zbl0229.68014MR317582
- [3] L. Kari, G. Păun and G. Rozenberg, A. Salomaa and S. Yu, DNA computing, sticker systems, and universality. Acta Inform. 35 (1998) 401–420. Zbl0904.68127MR1623221
- [4] M. Kutrib and M. Wendlandt, Bidirectional string assembling systems, in vol. 290 of Non-Classical Models of Automata and Applications (NCMA 2011). books@ocg.at. Austrian Computer Society, Vienna (2012) 107–121. MR3107865
- [5] M. Kutrib and M. Wendlandt, String assembling systems. RAIRO: ITA 46 (2012) 593–613. Zbl1279.68080MR3107865
- [6] R. McNaughton, Algebraic decision procedures for local testability. Math. Systems Theory8 (1974) 60–76. Zbl0287.02022MR392544
- [7] G. Păun and G. Rozenberg, Sticker systems. Theoret. Comput. Sci.204 (1998) 183–203. Zbl0908.68058MR1637532
- [8] E.L. Post, A variant of a recursively unsolvable problem. Bull. AMS52 (1946) 264–268. Zbl0063.06329MR15343
- [9] A.C. Yao and R.L. Rivest, k + 1 heads are better than k. J. ACM 25 (1978) 337–340. Zbl0372.68017MR483728
- [10] Y. Zalcstein, Locally testable languages. J. Comput. System Sci.6 (1972) 151–167. Zbl0242.68038MR307538

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.