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.
|Title of host publication
|Innovation and Analytics Conference and Exhibition, IACE 2015
|Subtitle of host publication
|Proceedings of the 2nd Innovation and Analytics Conference and Exhibition
|Nazihah Ahmad, Jafri Zulkepli, Adyda Ibrahim, Nazrina Aziz, Syariza Abdul-Rahman
|American Institute of Physics Inc.
|Published - Dec 11 2015
|2nd Innovation and Analytics Conference and Exhibition, IACE 2015 - Alor Setar, Kedah, Malaysia
Duration: Sept 29 2015 → Oct 1 2015
|AIP Conference Proceedings
|2nd Innovation and Analytics Conference and Exhibition, IACE 2015
|Alor Setar, Kedah
|9/29/15 → 10/1/15
ASJC Scopus subject areas
- General Physics and Astronomy