Watson-Crick Linear Grammars

N. L. Mohamad Zulkufli, S. Turaev, M. I. Mohd Tamrin, A. Messikh

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

1 Citation (Scopus)

Abstract

In this paper, we define Watson-Crick linear grammars extending Watson-Crick regular grammars Subramanian et al. (CCSEIT’12 proceedings of the second international conference on computer science, science, engineering and information technology 151–156, 2012, [9]) with linear rules, and study their generative power. We show that Watson-Crick linear grammars can generate some context-sensitive languages. Moreover, we establish that the family of Watson-Crick regular languages proper subset of the family of Watson-Crick linear languages but it is not comparable with the family of linear languages.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Data Engineering, DaEng 2015
EditorsJemal H. Abawajy, Mohamed Othman, Rozaida Ghazali, Mustafa Mat Deris, Hairulnizam Mahdin, Tutut Herawan
PublisherSpringer Verlag
Pages403-412
Number of pages10
ISBN (Print)9789811317972
DOIs
Publication statusPublished - 2019
Externally publishedYes
Event2nd International Conference on Advanced Data and Information Engineering, DaEng 2015 - Bali, Indonesia
Duration: Apr 25 2015Apr 26 2015

Publication series

NameLecture Notes in Electrical Engineering
Volume520
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2nd International Conference on Advanced Data and Information Engineering, DaEng 2015
Country/TerritoryIndonesia
CityBali
Period4/25/154/26/15

Keywords

  • Automata and formal languages
  • DNA computing
  • Watson-Crick automata
  • Watson-Crick grammars

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Watson-Crick Linear Grammars'. Together they form a unique fingerprint.

Cite this