The computational power of Watson-Crick grammars: Revisited

Mohamad Zulkufli, Nurul Liyana and Turaev, Sherzod and Mohd Tamrin, Mohd Izzuddin and Messikh Azeddine, Azeddine (2016) The computational power of Watson-Crick grammars: Revisited. In: The 5th Asian Conference on Membrane Computing (ACMC2016), 14th-16th November 2016, Bangi, Selangor Malaysia.

	PDF (published proceeding) - Published Version Restricted to Registered users only Download (1MB) | Request a copy
Preview	PDF Download (472kB) | Preview

Abstract

A Watson-Crick finite automaton is one of DNA computational models using the Watson-Crick complementarity feature of deoxyribonucleic acid (DNA). We are interested in investigating a grammar counterpart of Watson-Crick automata. In this paper, we present results concerning the generative power of Watson-Crick (regular, linear, context-free) grammars. We show that the family of Watson-Crick context-free languages is included in the family of matrix languages.

Item Type:	Conference or Workshop Item (Plenary Papers)
Additional Information:	6846/52955
Uncontrolled Keywords:	Watson-Crick automata, DNA computational models
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:	05 Dec 2016 11:55
Last Modified:	10 Oct 2017 11:01
URI:	http://irep.iium.edu.my/id/eprint/52955

Actions (login required)

View Item