Computational Properties of Watson-Crick Context-Free Grammars

Nurul Liyana Binti Mohamad Zulkufli, Sherzod Turaev, Mohd Izzuddin Mohd Tamrin, Azeddine Messikh, Imad Fakhri Taha Alshaikhli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Deoxyribonucleic acid, or popularly known as DNA, continues to inspire many theoretical computing models, such as sticker systems and Watson-Crick grammars. Sticker systems are the abstraction of ligation processes performed on DNA, while Watson-Crick grammars are models motivated from Watson-Crick finite automata and Chomsky grammars. Both of these theoretical models benefit from the Watson-Crick complementarity rule. In this paper, we establish the results on the relationship between Watson-Crick linear grammars, which is included in Watson-Crick context-free grammars, and sticker systems. We show that the family of arbitrary sticker languages, generated from arbitrary sticker systems, is included in the family of Watson-Crick linear languages, generated from Watson-Crick linear grammars.

Original languageEnglish
Title of host publicationProceedings - 2015 4th International Conference on Advanced Computer Science Applications and Technologies, ACSAT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages186-191
Number of pages6
ISBN (Electronic)9781509004249
DOIs
Publication statusPublished - May 25 2016
Externally publishedYes
Event4th International Conference on Advanced Computer Science Applications and Technologies, ACSAT 2015 - Kuala Lumpur, Malaysia
Duration: Dec 8 2015Dec 10 2015

Publication series

NameProceedings - 2015 4th International Conference on Advanced Computer Science Applications and Technologies, ACSAT 2015

Conference

Conference4th International Conference on Advanced Computer Science Applications and Technologies, ACSAT 2015
Country/TerritoryMalaysia
CityKuala Lumpur
Period12/8/1512/10/15

Keywords

  • formal grammars
  • formal languages
  • sticker systems
  • Watson-Crick automata
  • Watson-Crick grammars

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Computational Properties of Watson-Crick Context-Free Grammars'. Together they form a unique fingerprint.

Cite this