Static watson-crick linear grammars and its computational power

DNA computing, or more generally, molecular computing, is a recent development on computations using biological molecules, instead of the traditional siliconchips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal...

Full description

Bibliographic Details
Main Authors:	Abdul Rahman, Aqilahfarhana, Fong, Wan Heng, Sarmin, Nor Haniza, Sherzod Turaev, Sherzod, Mohamad Zulkufli, Nurul Liyana
Format:	Article
Language:	English English
Published:	Penerbit UTM Press. 2019
Subjects:	QA Mathematics QA76 Computer software T Technology (General)
Online Access:	http://irep.iium.edu.my/79429/ http://irep.iium.edu.my/79429/ http://irep.iium.edu.my/79429/4/79429_Static%20Watson-Crick%20Linear%20Grammars_article_new.pdf http://irep.iium.edu.my/79429/3/79429_Static%20Watson-Crick%20Linear%20Grammars_wos.pdf

id	iium-79429
recordtype	eprints
spelling	iium-794292020-03-05T06:18:21Z http://irep.iium.edu.my/79429/ Static watson-crick linear grammars and its computational power Abdul Rahman, Aqilahfarhana Fong, Wan Heng Sarmin, Nor Haniza Sherzod Turaev, Sherzod Mohamad Zulkufli, Nurul Liyana QA Mathematics QA76 Computer software T Technology (General) DNA computing, or more generally, molecular computing, is a recent development on computations using biological molecules, instead of the traditional siliconchips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal language theory. The operations of DNA molecules inspire various types of formal language tools which include sticker systems, grammars and automata. Recently, the grammar counterparts of Watson-Crick automata known as Watson-Crick grammars which consist of regular, linear and context-free grammars, are defined as grammar models that generate doublestranded strings using the important feature of Watson-Crick complementarity rule. In this research, a new variant of static Watson-Crick linear grammar is introduced as an extension of static Watson-Crick regular grammar. A static Watson-Crick linear grammar is a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar. There is a difference in generating double-stranded strings between a dynamic Watson-Crick linear grammar and a static Watson-Crick linear grammar. A dynamic Watson-Crick linear grammar produces each stranded string independently and only check for the Watson-Crick complementarity of a generated complete double-stranded string at the end; while the static Watson-Crick linear grammar generates both stranded strings dependently, i.e., checking for the WatsonCrick complementarity for each complete substring. The main result of the paper is to determine some computational properties of static Watson-Crick linear grammars. Next, the hierarchy between static Watson-Crick languages, Watson-Crick languages, Chomsky languages and families of languages generated by sticker systems are presented. Penerbit UTM Press. 2019-12 Article PeerReviewed application/pdf en http://irep.iium.edu.my/79429/4/79429_Static%20Watson-Crick%20Linear%20Grammars_article_new.pdf application/pdf en http://irep.iium.edu.my/79429/3/79429_Static%20Watson-Crick%20Linear%20Grammars_wos.pdf Abdul Rahman, Aqilahfarhana and Fong, Wan Heng and Sarmin, Nor Haniza and Sherzod Turaev, Sherzod and Mohamad Zulkufli, Nurul Liyana (2019) Static watson-crick linear grammars and its computational power. MATEMATIKA, 35 (3). pp. 283-296. E-ISSN 0127-9602 https://matematika.utm.my/index.php/matematika/article/view/283-296/820
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	QA Mathematics QA76 Computer software T Technology (General)
spellingShingle	QA Mathematics QA76 Computer software T Technology (General) Abdul Rahman, Aqilahfarhana Fong, Wan Heng Sarmin, Nor Haniza Sherzod Turaev, Sherzod Mohamad Zulkufli, Nurul Liyana Static watson-crick linear grammars and its computational power
description	DNA computing, or more generally, molecular computing, is a recent development on computations using biological molecules, instead of the traditional siliconchips. Some computational models which are based on different operations of DNA molecules have been developed by using the concept of formal language theory. The operations of DNA molecules inspire various types of formal language tools which include sticker systems, grammars and automata. Recently, the grammar counterparts of Watson-Crick automata known as Watson-Crick grammars which consist of regular, linear and context-free grammars, are defined as grammar models that generate doublestranded strings using the important feature of Watson-Crick complementarity rule. In this research, a new variant of static Watson-Crick linear grammar is introduced as an extension of static Watson-Crick regular grammar. A static Watson-Crick linear grammar is a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar. There is a difference in generating double-stranded strings between a dynamic Watson-Crick linear grammar and a static Watson-Crick linear grammar. A dynamic Watson-Crick linear grammar produces each stranded string independently and only check for the Watson-Crick complementarity of a generated complete double-stranded string at the end; while the static Watson-Crick linear grammar generates both stranded strings dependently, i.e., checking for the WatsonCrick complementarity for each complete substring. The main result of the paper is to determine some computational properties of static Watson-Crick linear grammars. Next, the hierarchy between static Watson-Crick languages, Watson-Crick languages, Chomsky languages and families of languages generated by sticker systems are presented.
format	Article
author	Abdul Rahman, Aqilahfarhana Fong, Wan Heng Sarmin, Nor Haniza Sherzod Turaev, Sherzod Mohamad Zulkufli, Nurul Liyana
author_facet	Abdul Rahman, Aqilahfarhana Fong, Wan Heng Sarmin, Nor Haniza Sherzod Turaev, Sherzod Mohamad Zulkufli, Nurul Liyana
author_sort	Abdul Rahman, Aqilahfarhana
title	Static watson-crick linear grammars and its computational power
title_short	Static watson-crick linear grammars and its computational power
title_full	Static watson-crick linear grammars and its computational power
title_fullStr	Static watson-crick linear grammars and its computational power
title_full_unstemmed	Static watson-crick linear grammars and its computational power
title_sort	static watson-crick linear grammars and its computational power
publisher	Penerbit UTM Press.
publishDate	2019
url	http://irep.iium.edu.my/79429/ http://irep.iium.edu.my/79429/ http://irep.iium.edu.my/79429/4/79429_Static%20Watson-Crick%20Linear%20Grammars_article_new.pdf http://irep.iium.edu.my/79429/3/79429_Static%20Watson-Crick%20Linear%20Grammars_wos.pdf
first_indexed	2023-09-18T21:51:28Z
last_indexed	2023-09-18T21:51:28Z
_version_	1777413798226821120

Static watson-crick linear grammars and its computational power

Similar Items