scispace - formally typeset
Open AccessProceedings ArticleDOI

Closure properties of Watson-Crick grammars

Nurul Liyana Mohamad Zulkufli, +3 more
- Vol. 1691, Iss: 1, pp 040032
Reads0
Chats0
TLDR
It is established 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.
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.

read more

Content maybe subject to copyright    Report

9/25/2017 Scopus - Document details
https://www.scopus.com/record/display.uri?eid=2-s2.0-84984535408&origin=resultslist&sort=plf-f&src=s&st1=Closure+properties+of+Watson-Crick+gr…
1/3
Scopus
Document details
References (15)
1 of 1
Closure properties of Watson-Crick grammars (Conference Paper)
, , ,
Department of Computer Science, Kulliyyah of Information and Communication Technology, International Islamic
University Malaysia, Kuala Lumpur, Malaysia
Department of Information System, Kulliyyah of Information and Communication Technology, International Islamic
University Malaysia, Kuala Lumpur, Malaysia
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. © 2015
AIP Publishing LLC.
Kari, L.,Seki, S.,Sosik, P.
(2012)
Handbook of Natural Computing
,pp. 1073-1127.
Freund, R.,Paun, G.,Rozernberg, G.,Salomaa, A.
(1999)
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
,48,pp. 297-327.
.
◅
Back to results
Export
Download
Print
E-mail
Save to PDF
⋆
Add to List
▻
More...
View at Publisher
AIP Conference Proceedings
Volume 1691, 11 December 2015, Article number040032
2nd Innovation and Analytics Conference and Exhibition, IACE 2015; TH HotelAlor Setar, Kedah; Malaysia; 29
September 2015through1 October 2015; Code121270
Binti Mohamad Zulkufli, N.L.
a
Turaev, S.
a
Tamrin, M.I.M.
b
Azeddine, M.
a
a
b
View references (15)
ISSN: 0094243X
ISBN: 978-073541338-2
Source Type: Conference
Proceeding
Original language: English
DOI: 10.1063/1.4937082
Document Type: Conference Paper
Volume Editors: Ahmad N.,Zulkepli J.,Ibrahim A.,Aziz
N.,Abdul-Rahman S.
Sponsors:
Publisher: American Institute of Physics Inc.
▻
View in search results format
All Export
Print
E-mail Save to PDF Create bibliography
1
2
Cited 35
times
PlumX Metrics
Usage, Captures, Mentions,
Social Media and Citations
beyond Scopus.
Metrics
1
Citation in Scopus
75th Percentile
1.61
Field-Weighted
Citation Impact
Cited by 1 document
,
,
(2016) Communications in
Computer and Information
Science
Inform me when this document
is cited in Scopus:
Related documents
, ,
(2016) Proceedings - 2015 4th
International Conference on
Advanced Computer Science
Applications and Technologies,
ACSAT 2015
,
,
▻
View all metrics
The computational power of
Watson-Crick grammars:
Revisited
Mohamad Zulkufli, N.L. Turaev,
S. Mohd Tamrin, M.I.
View details of this citation
▻
Set citation alert
▻
Set citation feed
Computational Properties of
Watson-Crick Context-Free
Grammars
Zulkufli, N.L.B.M. Turaev, S.
Tamrin, M.I.M.
The computational power of
Watson-Crick grammars:
Revisited
Mohamad Zulkufli, N.L. Turaev,
S. Mohd Tamrin, M.I.
9/25/2017 Scopus - Document details
https://www.scopus.com/record/display.uri?eid=2-s2.0-84984535408&origin=resultslist&sort=plf-f&src=s&st1=Closure+properties+of+Watson-Crick+gr…
2/3
Subramanian, K.G.,Hemalatha, S.,Venkat, I.
(2012)
ACM International Conference Proceeding Series
,pp. 151-156. .
ISBN: 978-145031310-0
doi: 10.1145/2393216.2393242
Sutapa, D.,Mukhopadhyay, S.
(2013)
PloS One
,82.
Eng, T.L.
(1998)
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
,48.
Mohd Tamrin, M.,Turaev, S.,Tengku Sembok, T.M.
(2013)
The 21st National Symposium on Methematical Sciences
Mohamad Zulkifli, N.,Turaev, S.,Mohd Tamrin, M.,Messikh, A.
Watson-crick linear grammars
(2015)
Lecture Notes in Electrical Engineering (DaEng 2015)
. .
(Bali, Indonesia) (to appear)
Czeizler, E.,Czeizler, E.
(2006)
Bulletin of the EATCS
,88,pp. 104-119. .
Paun, G.,Rozenberg, G.,Salomaa, A.
(1998)
DNA Computing. New Computing Paradigms
. .
(Springer-Verlag)
Rozenberg, G.,Salomaa, A.
(1997)
Handbook of Formal Languages
,1-3. .
(Springer-Verlag)
Okawa, S.,Hirose, S.
(2006)
IEICE Transactions on Information and Systems
,E89-D(10),pp. 2591-2599. .
doi: 10.1093/ietisy/e89-d.10.2591
Kari, L.,Paun, G.,Rozenberg, G.,Salomaa, A.,Yu, S.
(1998)
Acta Informatica
,35(5),pp. 401-420. .
3
On watson-crick automata
Cited 3 times
View at Publisher
4
5
6
7
Cited 3 times
8
Cited 14 times
9
Cited 496 times
10
Cited 1183 times
11
The relations among Watson-Crick automata and their relations with context-free
languages
Cited 7 times
https://www.jstage.jst.go.jp/browse/transinf
View at Publisher
12
DNA computing, sticker systems, and universality*
Cited 71 times
View at Publisher
(2016) Communications in
Computer and Information
Science
, ,
(2011) Proceedings - 2011 6th
International Conference on Bio-
Inspired Computing: Theories
and Applications, BIC-TA 2011
Find more related documents in
Scopus based on:
Context-free systems with a
complementarity relation
Subramanian, K.G. Venkat, I.
Mahalingam, K.
View all related documents based
on references
▻
Authors
9/25/2017 Scopus - Document details
https://www.scopus.com/record/display.uri?eid=2-s2.0-84984535408&origin=resultslist&sort=plf-f&src=s&st1=Closure+properties+of+Watson-Crick+gr…
3/3
1 of 1
Leupold, P.,Nagy, B.
(2010)
Fundamenta Informaticae
,104(1-2),pp. 71-91. .
doi: 10.3233/FI-2010-336
Subramanian, K.G.,Venkat, I.,Mahalingam, K.
(2011)
Bio-Inspired Computing: Theories and Applications (BIC-TA)
Reece, J.,Cain, M.L.,Wasserman, S.,Minorsky, P.V.,Jackson, R.B.
(2011)
Campbell Biology
. .
U. L.A., (10 Edition) (Pearson Education, Inc.)
Turaev, S.; Department of Computer Science, Kulliyyah of Information and Communication Technology,
International Islamic University Malaysia, Kuala Lumpur, Malaysia; email:
© Copyright 2016 Elsevier B.V., All rights reserved.
13
5′ → 3′ Watson-Crick automata with several runs
Cited 10 times
View at Publisher
14
15
Cited 148 times
th
sherzod@iium.edu.my
◅
Back to results
Top of page
About Scopus
What is Scopus
Content coverage
Scopus blog
Scopus API
Privacy matters
Language
⽇本語に切り替える
切换到简体中文
切換到繁體中文
Русский язык
Customer Service
Help
Contact us
Copyright © 2017 . All rights reserved. Scopus® is a registered trademark of
Elsevier B.V.
Cookies are set by this site. To decline them or learn more, visit our .
Terms and conditions Privacy policy
Elsevier B.V
Cookies page
Citations
More filters
Journal ArticleDOI

Watson–Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm

Nurul Liyana Mohamad Zulkufli, +3 more
- 01 Sep 2018 - 
TL;DR: A modified CYK (Cocke–Younger–Kasami) algorithm for Watson–Crick context-free grammars in WK-Chomsky normal form, allowing to parse double-stranded strings in O(n^6) time.
Proceedings ArticleDOI

Computational Properties of Watson-Crick Context-Free Grammars

Nurul Liyana Mohamad Zulkufli, +4 more
TL;DR: It is shown that the family of arbitrary sticker languages, generated from arbitrary sticker systems, is included in theFamily of Watson-Crick linear languages,generated from Watson-crick linear grammars.
Journal ArticleDOI

Static Watson-Crick Context-Free Grammars

Wan Heng Fong, +3 more
TL;DR: The main result of the paper is to determine the generative powers of static Watson-Crick context-free grammars, which is a grammar counterpart of sticker systems that generates the double-stranded strings and uses rule as in context- free grammar.
Book ChapterDOI

The Computational Power of Watson-Crick Grammars: Revisited

Nurul Liyana Mohamad Zulkufli, +3 more
TL;DR: Results concerning the generative power of Watson-Crick (regular, linear, context-free) grammars are presented and it is shown that the family of Watson -Crick context- free languages is included in thefamily of matrix languages.
Journal ArticleDOI

Static Watson-Crick Linear Grammars and Its Computational Power

Aqilahfarhana Abdul Rahman, +4 more
- 01 Dec 2019 - 
TL;DR: A new variant of static Watson-Crick linear grammar is introduced as an extension of static IBM regular grammar, a grammar counterpart of sticker system that generates the double-stranded strings and uses rule as in linear grammar.
References
More filters
BookDOI

Handbook of Formal Languages

Grzegorz Rozenberg, +1 more
TL;DR: This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field.
Book

DNA Computing: New Computing Paradigms

Gheorghe Paun, +2 more
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.

G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998)

康文 榊原
Journal ArticleDOI

DNA computing, sticker systems, and universality ?

Lila Kari, +4 more
- 01 May 1998 - 
TL;DR: Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata, and one variant is proven to be equivalent to Turing machines.
Journal ArticleDOI

Distinct effects of EGFR ligands on human mammary epithelial cell differentiation.

Chandrani Mukhopadhyay, +6 more
- 04 Oct 2013 - 
TL;DR: The present data validate the utility of the K5+K19- hMEC cells for modeling key features of human MEC differentiation and should be useful in studying molecular/biochemical mechanisms of humanMEC differentiation.
Related Papers (5)

Static Watson-Crick Context-Free Grammars

Wan Heng Fong, +3 more

Static Watson-Crick Linear Grammars and Its Computational Power

Aqilahfarhana Abdul Rahman, +4 more
- 01 Dec 2019 - 

Remarks on the Nonexistence of some Covering Grammars

Esko Ukkonen
- 26 Mar 1979 - 

Boolean grammars

Alexander Okhotin
- 01 Oct 2004 - 

Cooperating grammar systems

Robert Meersman, +1 more
Frequently Asked Questions (1)
Q1. What are the contributions in this paper?

In this paper, the authors define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules. The authors 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. The authors 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.