Skip to main content
SpringerLink
Log in

State and transition complexity of Watson-Crick finite automata

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1684))

Included in the following conference series:

Abstract

We consider the number of states and the number of transitions in Watson-Crick finite (non-deterministic) automata as descriptional complexity measures. The succinctness of recognizing regular languages by Watson-Crick (arbitrary or 1-limited) automata in comparison with non-deterministic finite automata is investigated, as well as decidability and computability questions. Major differences are found between finite automata and Watson-Crick finite automata from both these points of view.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Câmpeanu, N. Sântean, S. Yu, Minimal cover-automata for finite languages, International Workshop on Implementing Automata, WIA 98, Rouen, 1998, 32–42.

    Google Scholar 

  2. J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.

    Google Scholar 

  3. J. Engelfriet, G. Rozenberg, Fixed point languages, equality languages, and representations of recursively enumerable languages, Journal of the ACM, 27 (1980), 499–518.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Freund, Gh. Păun, G. Rozenberg, A. Salomaa, Watson-Crick finite automata, Proc. of the Third Annual DIMACS Symp. on DNA Based Computers, Philadelphia, 1997, 305–317.

    Google Scholar 

  5. R. Freund, Gh. Păun, G. Rozenberg, A. Salomaa, Watson-Crick automata, Technical Report 97-13, Dept. of Computer Sci., Leiden Univ., 1997.

    Google Scholar 

  6. J. Gruska, Descriptional complexity of context-free languages, Proc. MFCS’ 73, High Tatras, 1973, 71–83.

    Google Scholar 

  7. J. Hromkovic, One-way multihead deterministic finite automata, Acta Informatica, 19, 4 (1983), 377–384.

    Article  MATH  MathSciNet  Google Scholar 

  8. O. H. Ibarra, C. E. Kim, On 3-head versus 2-head finite automata, Inform. Control, 4 (1975), 193–200.

    MATH  MathSciNet  Google Scholar 

  9. Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Heidelberg, 1998.

    MATH  Google Scholar 

  10. A. L. Rosenberg, On multihead finite automata, IBM J. R. and D., 10 (1966), 388–394.

    Article  MATH  Google Scholar 

  11. G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.

    MATH  Google Scholar 

  12. K. Salomaa, S. Yu, Q. Zhuang, The state complexities of some basic operations on regular languages, Theoretical Computer Sci., 125 (1994), 315–328.

    Article  MATH  MathSciNet  Google Scholar 

  13. S. Yu, Regular languages, Chapter 2 in vol. 1 of [11], 41–110.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Andrei Păun & Mihaela Păun

Authors
  1. Andrei Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mihaela Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Păun, A., Păun, M. (1999). State and transition complexity of Watson-Crick finite automata. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation