Sticker Systems Over Monoids

N.A. Mohd Sebry, N. Z. A. Hamzah, N.H. Sarmin, W.H. Fong, S. Turaev

Abstract


Molecular computing has gained many interests among researchers since Head introduced the first theoretical model for DNA based computation using the splicing operation in 1987. Another model for DNA computing was proposed by using the sticker operation which Adlemanused in his successful experiment for the computation of Hamiltonian paths in a graph: a double stranded DNA sequence is composed by prolonging to the left and to the right a sequence of (single or double) symbols by using given single stranded strings or even more complex dominoes with sticky ends, gluing these ends together with the sticky ends of the current sequence according to a complementarity relation. According to this sticker operation, a language generative mechanism, called a sticker system, can be defined: a set of (incomplete) double-stranded sequences (axioms) and a set of pairs of single or double-stranded complementary sequences are given. The initial sequences are prolonged to the left and to the right by using sequences from the latter set, respectively. The iterations of these prolongations produce “computations” of possibly arbitrary length. These processes stop when a complete double stranded sequence is obtained. Sticker systems will generate only regular languages without restrictions. Additional restrictions can be imposed on the matching pairs of strands to obtain more powerful languages. Several types of sticker systems are shown to have the same power as regular grammars; one type is found to represent all linear languages whereas another one is proved to be able to represent any recursively enumerable language. The main aim of this research is to introduce and study sticker systems over monoids in which with each sticker operation, an element of a monoid is associated and a complete double stranded sequence is considered to be valid if the computation of the associated elements of the monoid produces the neutral element. Moreover, the sticker system over monoids is defined in this study.

Keywords


Sticker operation; Valence grammar; Valence sticker system; H system;

Full Text:

PDF

References


L.M. Adleman, Molecular Computations of Solutions to Combinatorial Problems. Science, 266 (1994), 1021-1024.

L. Kari, G. Paun, G. Rozenberg, A. Salomaa, and S. Yu, DNA Computing, Sticker Systems and Universality. ActaInformatica. 35 (1998), 401-420.

L. Kari, S. Seki, and P. Sosik, DNA Computing: Foundations and Implications for Computer Science. In G. Rozenberg, T. Back, and J. Kok, Springer-Verlag, 2010.

G. Paun, and G. Rozenberg, Sticker Systems, Theoretical Computer Science, 204 (1998), 183-203.

R. Freund, G. Paun, G. Rozenberg, and A. Salomaa, A Bidirectional Sticker Systems. In R. B. Altman, A. K. Dunker, L. Hunter, and T. E. Klein (Eds.), Pacific Symposium on Biocomputing. World Scientific, Singapore, 1998, 535-546.

J. Xu, Y. Dong, and X. Wei, Sticker DNA Computer Model, Part 1: Theory, Chinese Science Bulletin, 2004, 49(8), 772-780.

T. Audesirk, G. Audesirk, and B. E. Byers, Life on Earth, 4th Edition, United States of America, Pearson Prentice Hall, 2006.

G. Rozenberg, G. Paun, and A. Salomaa, DNA Computing: A New Computing Paradigms, New York, Springer-Verlag, 1998.

A. Alhazov, and M. Ferretti, Computing by Observing Bio-Systems: The Case of Sticker Systems. In C. Ferretti, G. Mauri, and C. Zandron Eds. DNA Computing: 10th International Workshop on DNA Computing, DNA 10, Milan, Italy, Springer-Verlag, 2004, 1-13.

H. J. Hoogeboom, and N. V. Vugt, Fair Sticker Languages, ActaInformatica, 37 (2000), 213-225.

N. V. Vugt, Models of Molecular Computing, University of Leiden, Ph.D. Thesis, 2002.

C. B. Gupta, S. R. Singh, and S. Kumar, Advance Discrete Structure, New Delhi, I. K International Publishing House Pvt. Ltd, 2010.

P. Linz, An Introduction to Formal Languages and Automata, 4th Edition, United States of America, Jones and Bartlett Publishers, 2006.

J. Dassow, and G. Paun, Regulated Rewriting in Formal Language Theory. In EATXS Monograph in Theoretical Computer Science, Springer-Verlag, 18 (1989).

H. Fernau, and R. Stiebe, Regulation by Valences. In B. Rovan (Ed.), Mathematical Foundations of Computer Science 1997 22nd International Symposium, MFCS’97 Proceedings, August 25-29, Springer-Verlag.

V. Manca, and G. Paun, Arithmetically Controlled H Systems, Computer Science of Moldova, 6 (1998), 103-118.




DOI: https://doi.org/10.11113/mjfas.v8n3.136

Refbacks

  • There are currently no refbacks.


Copyright (c) 2014 N.A. Mohd Sebry, N. Z. A. Hamzah, N.H. Sarmin, W.H. Fong, S. Turaev

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


Copyright © 2005-2019 Penerbit UTM Press, Universiti Teknologi Malaysia. Disclaimer: This website has been updated to the best of our knowledge to be accurate. However, Universiti Teknologi Malaysia shall not be liable for any loss or damage caused by the usage of any information obtained from this website.