Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]

A DNA model of computing using the recombinant behaviour of DNA molecules known as sticker system was introduced by Kari in 1994. Sticker system isan abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. It starts from incomplete dou...

Full description

Bibliographic Details
Main Authors: Selvarajoo, Mathuri, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod
Format: Article
Language:English
Published: Unit Penerbitan UiTM Kelantan 2016
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/29678/1/29678.pdf
_version_ 1825737037126303744
author Selvarajoo, Mathuri
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_facet Selvarajoo, Mathuri
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
author_sort Selvarajoo, Mathuri
collection UITM
description A DNA model of computing using the recombinant behaviour of DNA molecules known as sticker system was introduced by Kari in 1994. Sticker system isan abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. It starts from incomplete double-stranded sequences and using sticking operations iteratively which bring about complete double-stranded sequences.Sticker system and its variants including simple one-sided sticker system with finite sets of axioms and sticker rules, generate only regular languages. Therefore, different types of restrictions have been introduced in order to increase the computational power of the languages generated by sticker systems. In recent times, sticker system with probability as restriction, known as probabilistic sticker system is introduced. In this system, probabilities are initially associated with the axioms, and the probability of newly generated string is computed by multiplying the probabilities of all occurrences of the initial strings used in the computation of the new string. In this paper, the computational power of probabilistic simple one-sided sticker systems is investigated. We prove that the probability restriction on simple one-sided sticker system can increase the computational power of the languages generated
first_indexed 2024-03-06T02:11:58Z
format Article
id uitm.eprints-9678
institution Universiti Teknologi MARA
language English
last_indexed 2024-03-06T02:11:58Z
publishDate 2016
publisher Unit Penerbitan UiTM Kelantan
record_format dspace
spelling uitm.eprints-96782020-04-09T04:25:44Z https://ir.uitm.edu.my/id/eprint/29678/ Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.] jmcs Selvarajoo, Mathuri Fong, Wan Heng Sarmin, Nor Haniza Turaev, Sherzod Probabilities Programming languages (Electronic computers) A DNA model of computing using the recombinant behaviour of DNA molecules known as sticker system was introduced by Kari in 1994. Sticker system isan abstract computational model which uses the Watson-Crick complementarity principle of DNA molecules. It starts from incomplete double-stranded sequences and using sticking operations iteratively which bring about complete double-stranded sequences.Sticker system and its variants including simple one-sided sticker system with finite sets of axioms and sticker rules, generate only regular languages. Therefore, different types of restrictions have been introduced in order to increase the computational power of the languages generated by sticker systems. In recent times, sticker system with probability as restriction, known as probabilistic sticker system is introduced. In this system, probabilities are initially associated with the axioms, and the probability of newly generated string is computed by multiplying the probabilities of all occurrences of the initial strings used in the computation of the new string. In this paper, the computational power of probabilistic simple one-sided sticker systems is investigated. We prove that the probability restriction on simple one-sided sticker system can increase the computational power of the languages generated Unit Penerbitan UiTM Kelantan 2016 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/29678/1/29678.pdf Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]. (2016) Journal of Mathematics and Computing Science (JMCS) <https://ir.uitm.edu.my/view/publication/Journal_of_Mathematics_and_Computing_Science_=28JMCS=29/>, 2 (2). pp. 1-9. ISSN 0128-0767 https://jmcs.com.my/
spellingShingle Probabilities
Programming languages (Electronic computers)
Selvarajoo, Mathuri
Fong, Wan Heng
Sarmin, Nor Haniza
Turaev, Sherzod
Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title_full Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title_fullStr Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title_full_unstemmed Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title_short Computational power of probabilistic simple one-sided sticker languages / Mathuri Selvarajoo ...[et al.]
title_sort computational power of probabilistic simple one sided sticker languages mathuri selvarajoo et al
topic Probabilities
Programming languages (Electronic computers)
url https://ir.uitm.edu.my/id/eprint/29678/1/29678.pdf
work_keys_str_mv AT selvarajoomathuri computationalpowerofprobabilisticsimpleonesidedstickerlanguagesmathuriselvarajooetal
AT fongwanheng computationalpowerofprobabilisticsimpleonesidedstickerlanguagesmathuriselvarajooetal
AT sarminnorhaniza computationalpowerofprobabilisticsimpleonesidedstickerlanguagesmathuriselvarajooetal
AT turaevsherzod computationalpowerofprobabilisticsimpleonesidedstickerlanguagesmathuriselvarajooetal