Mohamad Zulkufli, Nurul Liyana and Turaev, Sherzod and Mohd Tamrin, Mohd Izzuddin and Messikh Azeddine, Azeddine (2016) Generative power and closure properties of Watson-Crick grammars. Applied Computational Intelligence and Soft Computing, 2016. pp. 1-12. ISSN 1687-9724 E-ISSN 1687-9732
PDF (Generative Power and Closure Properties of Watson-Crick Grammars)
- Published Version
Restricted to Repository staff only Download (1MB) | Request a copy |
|
PDF (WOS)
- Published Version
Restricted to Repository staff only Download (183kB) | Request a copy |
Abstract
We define WK linear grammars,as an extension of WK regular grammars with linear grammar rules,and WK context-free grammars, thus investigating their computational power and closure properties. We show that WK linear grammars can generate some context sensitive languages. Moreover, we demonstrate that the family of WK regular languages is the proper subset of the family of WK linear languages, but it is not comparable with the family of linear languages. We also establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations.
Item Type: | Article (Journal) |
---|---|
Additional Information: | 6846/52351 |
Uncontrolled Keywords: | Generative power, closure properties, 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: | 18 Oct 2016 14:41 |
Last Modified: | 09 Jan 2017 16:06 |
URI: | http://irep.iium.edu.my/id/eprint/52351 |
Actions (login required)
View Item |