Mohamad Zulkufli, Nurul Liyana and Turaev, Sherzod and Mohd Tamrin, Mohd Izzuddin and Messikh, Azeddin (2015) Closure properties of Watson-Crick grammars. AIP Conference Proceedings, 1691. 040032-1. ISSN 0094-243X E-ISSN 1551-7616
PDF
- Published Version
Restricted to Repository staff only Download (504kB) | Request a copy |
||
|
PDF
Download (467kB) | Preview |
Abstract
In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules. We show the relation of Watson-Crick (regular and linear) grammars to the sticker systems, and study some of the important closure properties of the Watson-Crick grammars. We establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations, while the differences between other Watson-Crick grammars with their corresponding Chomsky grammars depend on the computational power of the Watson-Crick grammars which still need to be studied.
Item Type: | Article (Journal) |
---|---|
Additional Information: | 6486/46381 |
Uncontrolled Keywords: | Watson-Crick grammars |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button): | Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Information System Kulliyyah of Information and Communication Technology > Department of Information System |
Depositing User: | Mohd Izzuddin Mohd Tamrin |
Date Deposited: | 29 Dec 2015 08:32 |
Last Modified: | 25 Sep 2017 12:03 |
URI: | http://irep.iium.edu.my/id/eprint/46381 |
Actions (login required)
View Item |