The computational power of Watson-Crick grammars: Revisited

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 Wa...

Full description

Bibliographic Details
Main Authors:	Mohamad Zulkufli, Nurul Liyana, Turaev, Sherzod, Mohd Tamrin, Mohd Izzuddin, Messikh Azeddine, Azeddine
Format:	Conference or Workshop Item
Language:	English English
Published:	2016
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/52955/ http://irep.iium.edu.my/52955/13/52955.pdf http://irep.iium.edu.my/52955/19/52955_The%20computational%20power%20of%20Watson_SCOPUS.pdf

id	iium-52955
recordtype	eprints
spelling	iium-529552017-10-10T03:01:50Z http://irep.iium.edu.my/52955/ The computational power of Watson-Crick grammars: Revisited Mohamad Zulkufli, Nurul Liyana Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Messikh Azeddine, Azeddine QA75 Electronic computers. Computer science 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. 2016 Conference or Workshop Item NonPeerReviewed application/pdf en http://irep.iium.edu.my/52955/13/52955.pdf application/pdf en http://irep.iium.edu.my/52955/19/52955_The%20computational%20power%20of%20Watson_SCOPUS.pdf 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.
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Mohamad Zulkufli, Nurul Liyana Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Messikh Azeddine, Azeddine The computational power of Watson-Crick grammars: Revisited
description	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.
format	Conference or Workshop Item
author	Mohamad Zulkufli, Nurul Liyana Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Messikh Azeddine, Azeddine
author_facet	Mohamad Zulkufli, Nurul Liyana Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Messikh Azeddine, Azeddine
author_sort	Mohamad Zulkufli, Nurul Liyana
title	The computational power of Watson-Crick grammars: Revisited
title_short	The computational power of Watson-Crick grammars: Revisited
title_full	The computational power of Watson-Crick grammars: Revisited
title_fullStr	The computational power of Watson-Crick grammars: Revisited
title_full_unstemmed	The computational power of Watson-Crick grammars: Revisited
title_sort	computational power of watson-crick grammars: revisited
publishDate	2016
url	http://irep.iium.edu.my/52955/ http://irep.iium.edu.my/52955/13/52955.pdf http://irep.iium.edu.my/52955/19/52955_The%20computational%20power%20of%20Watson_SCOPUS.pdf
first_indexed	2023-09-18T21:15:00Z
last_indexed	2023-09-18T21:15:00Z
_version_	1777411503074312192

The computational power of Watson-Crick grammars: Revisited

Similar Items