Advertisement

Watson-Crick Jumping Finite Automata

  • Kalpana Mahalingam
  • Rama RaghavanEmail author
  • Ujjwal Kumar Mishra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Jumping Finite Automata Watson-Crick automata Watson-Crick jumping finite automata 

References

  1. 1.
    Caetano-Anollés, G.: Evolutionary Genomics and Systems Biology. John Wiley & Sons Inc., Hoboken (2010)CrossRefGoogle Scholar
  2. 2.
    Chigahara, H., Fazekas, S.Z., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(3), 391–405 (2016)MathSciNetCrossRefGoogle Scholar
  3. 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. 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. 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)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Krithivasan, K., Rama, R.: Introduction to Formal Languages Automata Theory and Computation. Pearson, India (2009)Google Scholar
  7. 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. 8.
    Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555–1578 (2012)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing : New Computing Paradigms, 1st edn. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  10. 10.
    Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci. 29(1), 1–15 (2018)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of MathematicsIndian Institute of Technology MadrasChennaiIndia

Personalised recommendations