Skip to main content
Springer Nature Link
Log in

State complexity of deterministic Watson–Crick automata and time varying Watson–Crick automata

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Watson–Crick automata are finite automata working on double strands. Extensive research work has already been done on non-deterministic Watson–Crick automata and on deterministic Watson–Crick automata. State complexity of Watson–Crick automata has also been discussed. In this paper we analyze the state complexity of deterministic Watson–Crick automata with respect to non-deterministic block automata and non-deterministic finite automata. We also introduce new finite automata combining the properties of Watson–Crick automata and time varying automata. These automata have the unique property that the 1-limited stateless variant of these automata have the power to count. We further discuss the state complexity of time varying automata and time varying Watson–Crick automata.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Campeanu C, Santean N, Yu S (1998) Minimal cover automata for finite languages, International workshop on implementing automata, WIA 98, Rouen, 32–42

  • Czeizler E, Czeizler E (2005) Parallel communicating Watson-Crick Automata systems, Proc. 11th International Conference AFL

  • Czeizler E, Czeizler E (2006a) On the power of parallel communicating Watson–Crick automata systems. Theor Comput Sci 358(1):142–147

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Freund R, Păun G, Rozenberg G, Salomaa A (1997) Watson-Crick finite automata, Proc 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, 297–328

  • Krithivasan K, Das A (1986) Time varying finite automata. Int J Comput Math 19:103–123

    Article  MATH  Google Scholar 

  • Păun A, Păun M (1999) State and transition complexity of Watson-Crick finite automata. Fundam Comput Theory Lect Notes Comput Sci 1684:409–420

    Article  Google Scholar 

  • Păun G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer-Verlag, Berlin

    Book  MATH  Google Scholar 

  • Ray KS, Chatterjee K, Ganguly D (2013) Equivalence of subclasses of two-way non-deterministic Watson-Crick automata. Appl Math 4(10):26

    Article  Google Scholar 

  • Salomaa K, Yu S, Zhuang Q (1994) The state complexities of some basic operations on regular languages. Theor Comput Sci 125:315–328

    Article  MATH  MathSciNet  Google Scholar 

  • Yu S (1997) Regular languages, in handbook of formal languages, vol 1, chap 2. Springer, Berlin, pp 41–110

Download references

Author information

Authors and Affiliations

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

    Kumar Sankar Ray, Kingshuk Chatterjee & Debayan Ganguly

Authors
  1. Kumar Sankar Ray
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Kingshuk Chatterjee
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Debayan Ganguly
    View author publications

    You can also search for this author inPubMed 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

Ray, K.S., Chatterjee, K. & Ganguly, D. State complexity of deterministic Watson–Crick automata and time varying Watson–Crick automata. Nat Comput 14, 691–699 (2015). https://doi.org/10.1007/s11047-015-9494-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-015-9494-5

Keywords