String Assembling Systems

Martin Kutrib; Matthias Wendlandt

RAIRO - Theoretical Informatics and Applications (2012)

  • Volume: 46, Issue: 4, page 593-613
  • ISSN: 0988-3754

Abstract

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

How to cite

top

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

@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},
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},
month = {11},
number = {4},
pages = {593-613},
publisher = {EDP Sciences},
title = {String Assembling Systems},
url = {http://eudml.org/doc/222024},
volume = {46},
year = {2012},
}

TY - JOUR
AU - Kutrib, Martin
AU - Wendlandt, Matthias
TI - String Assembling Systems
JO - RAIRO - Theoretical Informatics and Applications
DA - 2012/11//
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/222024
ER -

References

top
  1. R. Freund, G. Păun, G. Rozenberg and A. Salomaa, Bidirectional sticker systems, in Pacific Symposium on Biocomputing (PSB). World Scientific, Singapore (1998) 535–546.  
  2. J. Hartmanis, On non-determinancy in simple computing devices. Acta Inf.1 (1972) 336–344.  Zbl0229.68014
  3. M. Holzer, M. Kutrib and A. Malcher, Multi-head finite automata : origins and directions. Theoret. Comput. Sci.412 (2011) 83–96.  Zbl1207.68188
  4. O.H. Ibarra, A note on semilinear sets and bounded-reversal multihead pushdown automata. Inf. Process. Lett.3 (1974) 25–28.  Zbl0294.68019
  5. O.H. Ibarra, J. Karhumäki and A. Okhotin, On stateless multihead automata : hierarchies and the emptiness problem. Theoret. Comput. Sci.411 (2009) 581–593.  Zbl1184.68316
  6. L. Kari, G. Păun, G. Rozenberg, A. Salomaa and S. Yu, DNA computing, sticker systems, and universality. Acta Inf.35 (1998) 401–420.  Zbl0904.68127
  7. R. McNaughton, Algebraic decision procedures for local testability. Math. Syst. Theory8 (1974) 60–76.  Zbl0287.02022
  8. W.F. Ogden, A helpful result for proving inherent ambiguity. Math. Syst. Theory2 (1968) 191–194.  Zbl0175.27802
  9. C.H. Papadimitriou, Computational Complexity. Addison-Wesley (1994)  
  10. G. Păun and G. Rozenberg, Sticker systems. Theoret. Comput. Sci.204 (1998) 183–203.  Zbl0908.68058
  11. E.L. Post, A variant of a recursively unsolvable problem. Bull. AMS52 (1946) 264–268.  Zbl0063.06329
  12. A. Salomaa, Formal Languages. Academic Press, New York (1973)  Zbl0262.68025
  13. L. Yang, Z. Dang and O.H. Ibarra, On stateless automata and P systems, in Workshop on Automata for Cellular and Molecular Computing. MTA SZTAKI (2007) 144–157.  
  14. A.C. Yao and R.L. Rivest, k + 1 heads are better than k. J. ACM25 (1978) 337–340.  Zbl0372.68017
  15. Y. Zalcstein, Locally testable languages. J. Comput. Syst. Sci.6 (1972) 151–167.  Zbl0242.68038

NotesEmbed ?

top

You must be logged in to post comments.

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

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.