Watson-Crick Linear Grammars

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Mohamad Zulkufli, N. L., Turaev, S., Mohd Tamrin, M. I., & Messikh, A. (2019). Watson-Crick Linear Grammars. In Lecture Notes in Electrical Engineering (Vol. 520, pp. 403–412). Springer Verlag. https://doi.org/10.1007/978-981-13-1799-6_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free