Skip to main content
SpringerLink
Log in

Reversible Watson–Crick automata

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Since 1970, reversible finite automata have generated interest among researcher; but till now, we have not come across a model of reversible read only one-way finite automata which accept all regular languages, In this paper, we introduce a new model of one-way reversible finite automata inspired by the Watson–Crick complementarity relation and show that our model can accept all regular languages. We further show that our model accepts a language which is not accepted by any multi-head deterministic finite automaton.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bennet, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  2. Morita, K.: Two-way reversible multi-head finite automata. Fundam. Inform. 110, 241–254 (2011)

    MathSciNet  MATH  Google Scholar 

  3. Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. In: Reversible Computation. Lecture Notes in Computer Science, vol. 7581, pp. 14–28 (2013)

  4. Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78(6), 1814–1827 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Pin, J.E.: On reversible automata. In: Proceedings of the first LATIN conference, Sao-Paulo, Brazil. Lecture Notes in Computer Science, vol. 583, pp. 401–416. Springer (1992)

  6. Freund, R., Păun, G., Rozenberg, G., Salomaa, A.: Watson–Crick finite automata. In: Proceedings of 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, pp. 297–328 (1997)

  7. Păun, G., Rozenberg, G., Salomaa, A., Computing, D.N.A.: New Computing Paradigms. Springer, Berlin (1998)

    MATH  Google Scholar 

  8. Czeizler, E., Czeizler, E., Kari, L., Salomaa, K.: On the descriptional complexity of Watson–Crick automata. Theor. Comput. Sci. 410(35), 3250–3260 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ray, K.S., Chatterjee, K., Ganguly, D.: Equivalence of subclasses of two-way non-deterministic Watson-Crick automata. Appl. Math. 4(10A), 26–34 (2013)

    Article  Google Scholar 

  10. Czeizler, E., Czeizler, E.: A short survey on Watson–Crick automata. Bull. EATCS 88, 104–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Păun, A., Păun, M.: State and transition complexity of Watson–Crick finite automata. In: Fundamentals of Computation Theory, vol. 1684, pp. 409–420. Lecture Notes in Computer Science (1999)

  12. Ray, K.S., Chatterjee, K., Ganguly, D.: State complexity of deterministic Watson–Crick automata and time varying Watson–Crick automata. Nat. Comput. 14(4), 691–699 (2015)

    Article  MathSciNet  Google Scholar 

  13. Kuske, D., Weigel, P.:The role of the complementarity relation in Watson–Crick automata and sticker systems. IN: Proceedings of DLT 2004. LNCS 3340, pp. 272–283. Springer (2004)

  14. Sempere, J.M.: Exploring regular reversibility in Watson–Crick finite automata. In: The Thirteenth International Symposium on Artificial Life and Robotics 2008 (AROB 13th ’08), B-Con Plaza, Beppu, Oita, Japan, January 31–February 2 (2008)

  15. Yao, A.C., Rivest, R.L.: k + 1 Heads are better than k. J. ACM (JACM) 25(2), 337–340 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, 700108, India

    Kingshuk Chatterjee & Kumar Sankar Ray

Authors
  1. Kingshuk Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kumar Sankar Ray
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kumar Sankar Ray.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, K., Ray, K.S. Reversible Watson–Crick automata. Acta Informatica 54, 487–499 (2017). https://doi.org/10.1007/s00236-016-0267-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-016-0267-0

Keywords

Search

Navigation