Skip to main content
SpringerLink
Log in

Watson-Crick Jumping Finite Automata

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11436))

Abstract

In this paper, we introduce a new automata called Watson-Crick jumping finite automata, working on tapes which are double stranded sequences of symbols, similar to that of a Watson-Crick automata. This automata scans the double stranded sequence in a discontinuous manner (i.e.) after reading a double stranded string, the automata can jump over some subsequence and continue scanning, depending on the rule. We define some variants of such automata and compare the languages accepted by these variants with the language classes in Chomsky hierarchy. We also investigate some closure properties.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Caetano-Anollés, G.: Evolutionary Genomics and Systems Biology. John Wiley & Sons Inc., Hoboken (2010)

    Book  Google Scholar 

  2. Chigahara, H., Fazekas, S.Z., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(3), 391–405 (2016)

    Article  MathSciNet  Google Scholar 

  3. Freund, R., Păun, Gh., Rozenberg, G., Salomaa, A.: Watson-Crick finite automata. In: The Proceedings of the 3rd Annual DIMACS Symposium on DNA Based Computers, Philadelphia, pp. 305–317 (1997)

    Google Scholar 

  4. Freund, R., Păun, G., Rozenberg, G., Salomaa, A.: Watson-Crick automata, Technical report 97–13. Leiden University, Department of Computer Science (1997)

    Google Scholar 

  5. Kari, L., Păun, G., Rozenberg, G., Salomaa, A., Yu, S.: DNA computing, sticker systems, and universality. Acta Informatica 35(5), 401–420 (1998)

    Article  MathSciNet  Google Scholar 

  6. Krithivasan, K., Rama, R.: Introduction to Formal Languages Automata Theory and Computation. Pearson, India (2009)

    Google Scholar 

  7. Martin-Vide, C., Păun, Gh, Rozenberg, G., Salomaa, A.: Universality results for finite H systems and for Watson-Crick finite automata. In: Păun, Gh (ed.) Computing with Bio-Molecules, Theory and Experiments, pp. 200–220. Springer, Berlin (1998)

    Google Scholar 

  8. Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)

    Article  MathSciNet  Google Scholar 

  9. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing : New Computing Paradigms, 1st edn. Springer, Heidelberg (1998)

    Book  Google Scholar 

  10. Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci. 29(1), 1–15 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Madras, Chennai, 600036, India

    Kalpana Mahalingam, Rama Raghavan & Ujjwal Kumar Mishra

Authors
  1. Kalpana Mahalingam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rama Raghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ujjwal Kumar Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rama Raghavan .

Editor information

Editors and Affiliations

  1. Anna University, Chennai, India

    T.V. Gopal

  2. Waseda University, Kitakyushu, Japan

    Junzo Watada

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mahalingam, K., Raghavan, R., Mishra, U.K. (2019). Watson-Crick Jumping Finite Automata. In: Gopal, T., Watada, J. (eds) Theory and Applications of Models of Computation. TAMC 2019. Lecture Notes in Computer Science(), vol 11436. Springer, Cham. https://doi.org/10.1007/978-3-030-14812-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14812-6_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14811-9

  • Online ISBN: 978-3-030-14812-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation