DocumentCode :
3775264
Title :
Computational Properties of Watson-Crick Context-Free Grammars
Author :
Nurul Liyana binti Mohamad Zulkufli;Sherzod Turaev;Mohd Izzuddin Mohd Tamrin;Azeddine Messikh;Imad Fakhri Taha Alshaikhli
Author_Institution :
Dept. of Comput. Sci., KICT Int. Islamic Univ. Malaysia, Kuala Lumpur, Malaysia
fYear :
2015
Firstpage :
186
Lastpage :
191
Abstract :
Deoxyribonucleic acid, or popularly known as DNA, continues to inspire many theoretical computing models, such as sticker systems and Watson-Crick grammars. Sticker systems are the abstraction of ligation processes performed on DNA, while Watson-Crick grammars are models motivated from Watson-Crick finite automata and Chomsky grammars. Both of these theoretical models benefit from the Watson-Crick complementarity rule. In this paper, we establish the results on the relationship between Watson-Crick linear grammars, which is included in Watson-Crick context-free grammars, and sticker systems. We show that the family of arbitrary sticker languages, generated from arbitrary sticker systems, is included in the family of Watson-Crick linear languages, generated from Watson-Crick linear grammars.
Keywords :
"Grammar","Automata","Production","DNA","Electronic mail","Formal languages"
Publisher :
ieee
Conference_Titel :
Advanced Computer Science Applications and Technologies (ACSAT), 2015 4th International Conference on
Print_ISBN :
978-1-5090-0423-2
Type :
conf
DOI :
10.1109/ACSAT.2015.19
Filename :
7478741
Link To Document :
بازگشت