Skip to main content
SpringerLink
Log in

On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata

(Extended Abstract)

  • Conference paper
Unconventional Computation and Natural Computation (UCNC 2013)

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

Abstract

Counter machines are finite state automata equipped with a fixed, finite number of counters. The machine can check whether a counter is zero or not. In each step, a counter’s value can be increased by one, decreased by one, or left unchanged. Counter machines with two counters are Turing universal [5]. 5′ → 3′ Watson- Crick automata are two-head finite automata whose reading heads start from the two opposite ends of the input in the beginning of the computation [3,4]. Stateless multicounter 5′ → 3′ Watson-Crick automata were defined in [1,2]. The following is a more general definition, allowing to read strings in a transition.

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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. Eğecioğlu, Ö., Hegedüs, L., Nagy, B.: Stateless multicounter 5′ → 3′ Watson-Crick automata. In: IEEE Fifth Int. Conf. BIC-TA, pp. 1599–1606 (2010)

    Google Scholar 

  2. Hegedüs, L., Nagy, B., Eğecioğlu, Ö.: Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. Natural Computing 11, 361–368 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Nagy, B.: On 5′ →3′ sensing Watson-Crick finite automata. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 256–262. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Freund, R., Păun, G., Rozenberg, G., Salomaa, A.: Watson-Crick Finite Automata. In: Third Ann. DIMACS Symp. on DNA Based Computers, pp. 535–546 (1994)

    Google Scholar 

  5. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Upper Saddle River (1967)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary

    László Hegedüs & Benedek Nagy

Authors
  1. László Hegedüs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Communicazione, Università degli Studi di Milano-Bicocca, Viale Sacra 336/14, 20126, Milan, Italy

    Giancarlo Mauri

  2. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, Viale Sarca 336, 20126, Milano, Italy

    Alberto Dennunzio  & Luca Manzoni  & 

  3. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Viale Sarca 336/14, 20126, Milano, Italy

    Antonio E. Porreca

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hegedüs, L., Nagy, B. (2013). On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds) Unconventional Computation and Natural Computation. UCNC 2013. Lecture Notes in Computer Science, vol 7956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39074-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39074-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39073-9

  • Online ISBN: 978-3-642-39074-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation