Sticker systems over monoids

• Main Authors: Mohd. Sebry, N. A., Hamzah, N. Z. A., Sarmin, NorHaniza, Fong, Wan Heng, Turaev, S.
• Format: Article
• Language: English
• Published: Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2012
• Subjects: QA Mathematics; QA75 Electronic computers. Computer science; QA76 Computer software
• Online Access: http://eprints.utm.my/id/eprint/29081/1/NorHanizaSarmin2012_StickerSystemsOverMonoids.pdf; http://eprints.utm.my/id/eprint/29081/; http://mjfas.ibnusina.utm.my/index.php/jfs/article/viewFile/289/228

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.