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

Mohamad Zulkufli, Nurul Liyana

Turaev, Sherzod

Mohd Tamrin, Mohd Izzuddin

Messikh Azeddine, Azeddine

English

The International Islamic University Malaysia Repository

ScopusDocument details 1 of 1The computational power of Watson-Crick grammars: Revisited (ConferencePaper),  ,  ,   Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, Kuala Lumpur,MalaysiaAbstractA Watson-Crick finite automaton is one of DNA computational models using the Watson-Crick complementarityfeature of deoxyribonucleic acid (DNA). We are interested in investigating a grammar counterpart of Watson-Crickautomata. 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 matrixlanguages. © Springer Nature Singapore Pte Ltd. 2016.Indexed keywordsEngineeringcontrolled terms:Computation theory Nucleic acidsCompendex keywords Computational model Computational power Context-free Matrix languagesWatson-Crick finite automataEngineering mainheading:Context free languagesFunding detailsFunding number Funding sponsor AcronymEDW B14-136-1021 International Islamic University Malaysia IIUMFunding textThis work has been supported through International Islamic University Endowment B research grant EDW B14-136-1021 and Fundamental Research Grant Scheme FRGS13-066-0307, Ministry of Education, Malaysia◅ Back to results Export  Download  Print  E-mail  Save to PDF ⋆ Add to List  ▻More...View at PublisherCommunications in Computer and Information ScienceVolume 681, 2016, Pages 215-22511th International Conference on Bio-inspired Computing – Theories and Applications, BIC-TA 2016; Xian; China; 28October 2016 through 30 October 2016; Code 188409Mohamad Zulkufli, N.L.  Turaev, S.  Mohd Tamrin, M.I.  Messikh, A.   View references (24)ISSN: 18650929ISBN: 978-981103610-1Source Type: Book seriesOriginal language: EnglishDOI: 10.1007/978-981-10-3611-8_20Document Type: Conference PaperVolume Editors: Pan L.,Gong M.,Song T.,SongT.,Zhang G.Sponsors: Huazhong University of Science andTechnology,Huazhong University of Science andTechnology,Xidian UniversityPublisher: Springer VerlagPlumX MetricsUsage, Captures, Mentions,Social Media and Citationsbeyond Scopus.Metrics 0 Citations in Scopus0 Field-WeightedCitation ImpactCited by 0 documentsInform me when this documentis cited in Scopus:Related documents, , (2015) AIP ConferenceProceedings,  ,(2016) Proceedings - 2015 4thInternational Conference onAdvanced Computer ScienceApplications and Technologies,ACSAT 2015,  , (2012) ACM InternationalConference Proceeding Series  Find more related documents inScopus based on: ▻Set citation alert  ▻Set citation feedClosure properties of Watson-Crick grammars Binti Mohamad Zulkufli, N.L.Turaev, S. Tamrin, M.I.M.Computational Properties ofWatson-Crick Context-FreeGrammars Zulkufli, N.L.B.M. Turaev, S.Tamrin, M.I.M.On watson-crick automata Subramanian, K.G. Hemalatha,S. Venkat, I.View all related documents basedon referencesReferences (24)Paun, G. (2000) Journal of Computer and System Sciences, 61 (1), pp. 108-143.  . doi: 10.1006/jcss.1999.1693 Pun, G., Rozenberg, G. (2002) Theoretical Computer Science, 287 (1), pp. 73-100.  . doi: 10.1016/S0304-3975(02)00136-6 Paun, G. Introduction to membrane computing (2006) Applications of Membrane Computing, pp. 1-42.  . Ciobanu, G., Paun, G., Pérez-Jiménez, M.J. (eds.), Springer, Heidelberg  Zhang, X., Liu, Y., Luo, B., Pan, L. (2014) Information Sciences, 278, pp. 285-297.  . doi: 10.1016/j.ins.2014.03.053 Zeng, X., Xu, L., Liu, X., Pan, L. (2014) Information Sciences, 278, pp. 423-433.  . doi: 10.1016/j.ins.2014.03.062 Wang, X., Song, T., Gong, F., Zheng, P. (2016) Scientific Reports, 6, art. no. 27624.  .  doi: 10.1038/srep27624 Freund, R. An integrating view on DNA computing and membrane computing (2008) Proceedings of the 9Th WSEAS International Conference on Evolutionary Computing, pp. 15-20.  . Sofia, Bulgaria  Freund, R., Paun, G., Rozernberg, G., Salomaa, A. Watson-Crick finite automata. DIMACS Ser. Discret (1999) Math. Theor. Comput. Sci, 48, pp. 297-327.  .   ▻View in search results format     All Export  Print  E-mail  Save to PDF Create bibliography1Computing with membranesCited 1293 timesView at Publisher2A guide to membrane computingCited 195 timesView at Publisher3Cited 3 times4Computational power of tissue P systems for generating control languagesCited 62 timesView at Publisher5On languages generated by spiking neural P systems with weightsCited 36 timesView at Publisher6On the computational power of spiking neural P systems with self-organizationCited 23 timeswww.nature.com/srep/index.htmlView at Publisher7Cited 2 times8Cited 35 times ▻Authors  ▻KeywordsPăun, G., Rozenberg, G., Salomaa, A. (1998) DNA Computing: New Computing Paradigms.  . Springer-Verlag, Heidelberg  Mohd Tamrin, M., Turaev, S., Tengku Sembok, T.M. Weighted Watson-Crick automata (2013) The 21St National Symposium on Mathematical Sciences  Czeizler, E., Czeizler, E. A short survey on Watson-Crick automata (2006) Bull. EATCS, 88, pp. 104-119.  .  López, V.F., Aguilar, R., Alonso, L., Moreno, M.N., Corchado, J.M. (2012) Neurocomputing, 75, pp. 88-97.  . doi: 10.1016/j.neucom.2011.03.049 Datta, S., Mukhopadhyay, S. (2013) PLoS ONE, 8 (2), art. no. e54843.  .  doi: 10.1371/journal.pone.0054843 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 Subramanian, K.G., Venkat, I., Mahalingam, K. (2011) Proceedings - 2011 6th International Conference on Bio-Inspired Computing: Theories andApplications, BIC-TA 2011, art. no. 6046897, pp. 194-198.  . ISBN: 978-076954514-1 doi: 10.1109/BIC-TA.2011.28 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 9Cited 497 times1011Cited 14 times12Grammatical inference with bioinformatics criteriaCited 2 timesView at Publisher13A Composite Method Based on Formal Grammar and DNA Structural Features inDetecting Human Polymerase II Promoter RegionCited 6 timeshttp://www.plosone.org/article/fetchObjectAttachment.action?uri=info%3Adoi%2F10.1371%2Fjournal.pone.0054843&representation=PDFView at Publisher14The relations among Watson-Crick automata and their relations with context-freelanguagesCited 7 timeshttps://www.jstage.jst.go.jp/browse/transinfView at Publisher15Context-free systems with a complementarity relationCited 2 timesView at Publisher16On watson-crick automataCited 3 timesView at Publisher 1 of 1Mohamad Zulkufli, N., Turaev, S., Mohd Tamrin, M., Messikh, A. Watson-Crick linear grammars (2015) The Second International Conference on Advanced Data and Information Engineering.  . DaEng 2015, Bali, Indonesia. Lecture Notes in Electrical Engineering, to appear  Binti Mohamad Zulkufli, N.L., Turaev, S., Tamrin, M.I.M., Azeddine, M. (2015) AIP Conference Proceedings, 1691, art. no. 040032.  ISBN: 978-073541338-2 doi: 10.1063/1.4937082 Zulkufli, N.L.B.M., Turaev, S., Tamrin, M.I.M., Messikh, A., Alshaikhli, I.F.T. (2015) Proceedings - 2015 4th International Conference on Advanced Computer Science Applications andTechnologies, ACSAT 2015, art. no. 7478741, pp. 186-191. ISBN: 978-150900424-9 doi: 10.1109/ACSAT.2015.19 Mohamad Zulkufli, N.L., Turaev, S., Mohd Tamrin, M.I., Messikh, A. Generative power and closure properties of Watson-Crick grammars (2016) Appl. Comput. Intell. Soft Comput, p. 12. 2016  Linz, P. (2006) An Introduction to Formal Languages and Automata.  . Jones and Bartlett Publishers Inc., Burlington  Rozenberg, G., Salomaa, A. (1997) Handbook of Formal Languages, 1-3.  . Springer- Verlag, Heidelberg  Dassow, J. Grammars with regulated rewriting (2004) Formal Languages and Applications, 148, pp. 249-273.  . Martín-Vide, C., Mitrana, V., Paun, G. (eds.), Springer, Heidelberg  Dassow, J., Paun, G. (2012) Regulated Rewriting in Formal Language Theory.  . Springer Publishing Company, Heidelberg   Turaev, S.; Kulliyyah of Information and Communication Technology, International Islamic University Malaysia,Kuala Lumpur, Malaysia; email:   © Copyright 2017 Elsevier B.V., All rights reserved.17Cited 3 times18Closure properties of Watson-Crick grammarshttp://scitation.aip.org/content/aip/proceeding/aipcpView at Publisher19Computational Properties of Watson-Crick Context-Free GrammarsView at Publisher2021Cited 221 times22Cited 1188 times23Cited 13 times24Cited 474 times sherzod@iium.edu.my◅ Back to results  Top of pageAbout ScopusWhat is ScopusContent coverageScopus blogScopus APIPrivacy mattersLanguage⽇本語に切り替える切换到简体中文切換到繁體中文Русский языкCustomer ServiceHelpContact us Copyright © 2017 . All rights reserved. Scopus® is a registered trademark ofElsevier B.V.  Cookies are set by this site. To decline them or learn more, visit our .Terms and conditions Privacy policyElsevier B.VCookies page

The computational power of Watson-Crick grammars: Revisited

http://irep.iium.edu.my/52955/19/52955_The%20computational%20power%20of%20Watson_SCOPUS.pdf

The computational power of Watson-Crick grammars: Revisited

Abstract

Similar works

Full text

Available Versions

The International Islamic University Malaysia Repository