Skip to main content
SpringerLink
Log in

Watson-Crick Linear Grammars

  • Conference paper
  • First Online:
Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 520))

  • 300 Accesses

Abstract

In this paper, we define Watson-Crick linear grammars extending Watson-Crick regular grammars Subramanian et al. (CCSEIT’12 proceedings of the second international conference on computer science, science, engineering and information technology 151–156, 2012, [9]) with linear rules, and study their generative power. We show that Watson-Crick linear grammars can generate some context-sensitive languages. Moreover, we establish that the family of Watson-Crick regular languages proper subset of the family of Watson-Crick linear languages but it is not comparable with the family of linear languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Czeizler, E., Czeizler, E.: A short survey on watson-crick automata. Bulletin of the EATCS 88, 104–119 (2006)

    Article  MathSciNet  Google Scholar 

  2. Freund, R., Paun, G., Rozernberg, G., Salomaa, A.: Watson-Crick finite automata. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 48, 297–327 (1999)

    Article  MathSciNet  Google Scholar 

  3. Kari, L., Seki, S., Sosik, P.: DNA computing - foundations and implications. Handb. Nat. Comput. 1073–1127 (2012)

    Google Scholar 

  4. Leupold, P., Nagy, B.: 5’-3’ Watson-Crick automata with several runs. Fundam. Informaticae 104(1–2), 71–91 (2010)

    MathSciNet  MATH  Google Scholar 

  5. Mohd Tamrin, M., Turaev, S., Tengku Sembok, T.M.: Weighted Watson-Crick automata. AIP Conf. Proc. 1605, 302–306 (2014)

    Google Scholar 

  6. Okawa, S., Hirose, S.: The relations among Watson-Crick automata and their relations with context-free languages. IEICE Trans. Inf. Syst. E89(D(10)), 2591–2599 (2006)

    Article  Google Scholar 

  7. Pǎun, G., Rozenberg, G., Salomaa, A.: DNA Computing. Springer-Verlag, New computing paradigms (1998)

    Chapter  Google Scholar 

  8. Rozenberg, G., Salomaa, A.: Handbook of formal languages. Volumes (pp. 1–3). Springer-Verlag (1997)

    Google Scholar 

  9. Subramanian, K., Hemalatha, S., Venkat, I.: On Watson-Crick automata. In: CCSEIT’12 Proceedings of the Second International Conference on Computer Science, Science, Engineering and Information Technology, pp. 151–156. Coimbatore, India (2012)

    Google Scholar 

Download references

Acknowledgements

This 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.

Author information

Authors and Affiliations

  1. Department of Computer Science, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 53100, Kuala Lumpur, Malaysia

    N. L. Mohamad Zulkufli & A. Messikh

  2. Faculty of Engineering and Natural Sciences, International University of Sarajevo, Hrasnička cesta 15, 71210, Ilidža, Bosnia and Herzegovina

    S. Turaev

  3. Department of Information Systems, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 53100, Kuala Lumpur, Malaysia

    M. I. Mohd Tamrin

Authors
  1. N. L. Mohamad Zulkufli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Turaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. I. Mohd Tamrin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. Messikh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Turaev .

Editor information

Editors and Affiliations

  1. School of Information Technology, Deakin University, Geelong, VIC, Australia

    Jemal H. Abawajy

  2. Department of Communication Technology and Network, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Serdang, Malaysia

    Mohamed Othman

  3. Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia

    Rozaida Ghazali

  4. Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia

    Mustafa Mat Deris

  5. Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Johor, Malaysia

    Hairulnizam Mahdin

  6. Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur, Malaysia

    Tutut Herawan

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohamad Zulkufli, N.L., Turaev, S., Mohd Tamrin, M.I., Messikh, A. (2019). Watson-Crick Linear Grammars. In: Abawajy, J., Othman, M., Ghazali, R., Deris, M., Mahdin, H., Herawan, T. (eds) Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015) . Lecture Notes in Electrical Engineering, vol 520. Springer, Singapore. https://doi.org/10.1007/978-981-13-1799-6_42

Download citation

Publish with us

Policies and ethics

Search

Navigation