TY - GEN
T1 - Closure properties of static Watson-Crick linear and context-free grammars
AU - Rahman, Aqilahfarhana Abdul
AU - Fong, Wan Heng
AU - Sarmin, Nor Haniza
AU - Turaev, Sherzod
N1 - Publisher Copyright:
© 2020 Author(s).
PY - 2020/10/6
Y1 - 2020/10/6
N2 - In DNA computing, a sticker system is a computing mechanism involving the Watson-Crick complementarity of DNA molecules. The sticker system is known as a language generating device based on the sticker operation which is analyzed through the concept of formal language theory. The grammar of a formal language can be described by determining finite sets of variables, terminal symbols and production rules. Research on the grammar which uses the Watson-Crick complementarity has been done previously, known as Watson-Crick grammars. As an improvement to the Watson-Crick grammars, the static Watson-Crick grammars have been proposed as an analytical counterpart of sticker system which consist of regular grammar, linear grammar and context-free grammar. In this research, the closure properties of static Watson-Crick linear and context-free grammars are investigated. The result shows that the families of languages generated by static Watson-Crick linear and context-free grammars are closed under different operations.
AB - In DNA computing, a sticker system is a computing mechanism involving the Watson-Crick complementarity of DNA molecules. The sticker system is known as a language generating device based on the sticker operation which is analyzed through the concept of formal language theory. The grammar of a formal language can be described by determining finite sets of variables, terminal symbols and production rules. Research on the grammar which uses the Watson-Crick complementarity has been done previously, known as Watson-Crick grammars. As an improvement to the Watson-Crick grammars, the static Watson-Crick grammars have been proposed as an analytical counterpart of sticker system which consist of regular grammar, linear grammar and context-free grammar. In this research, the closure properties of static Watson-Crick linear and context-free grammars are investigated. The result shows that the families of languages generated by static Watson-Crick linear and context-free grammars are closed under different operations.
UR - http://www.scopus.com/inward/record.url?scp=85094617051&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85094617051&partnerID=8YFLogxK
U2 - 10.1063/5.0018350
DO - 10.1063/5.0018350
M3 - Conference contribution
AN - SCOPUS:85094617051
T3 - AIP Conference Proceedings
BT - Proceedings of the 27th National Symposium on Mathematical Sciences, SKSM 2019
A2 - Ibrahim, Siti Nur Iqmal
A2 - Ibrahim, Noor Akma
A2 - Ismail, Fudziah
A2 - Lee, Lai Soon
A2 - Leong, Wah June
A2 - Midi, Habshah
A2 - Wahi, Nadihah
PB - American Institute of Physics Inc.
T2 - 27th National Symposium on Mathematical Sciences, SKSM 2019
Y2 - 26 November 2019 through 27 November 2019
ER -