DNA Computing pp 151-186 | Cite as

Watson—Crick Automata

  • Gheorghe Păun
  • Grzegorz Rozenberg
  • Arto Salomaa
Part of the Texts in Theoretical Computer Science book series (TTCS)


In this chapter we investigate the automata counterpart of the sticker systems studied in the previous chapter. We consider a new type of automata, working on tapes which are double stranded sequences of symbols related by a complementarity relation, similar to a DNA molecule (such a data structure is called a Watson-Crick tape). The automata scan separately each of the two strands, in a correlated manner. They can also have a finite number of states controlling the moves and/or they can have an auxiliary memory which is also a Watson—Crick tape, used in a FIFO-like manner Combining such possibilities we obtain several types of automata. In most cases, these automata augmented with squeezing mechanisms, such as weak codings and deterministic sequential transducers, characterize the recursively enumerable languages.


Transition Rule Regular Language Finite Automaton Control Word Enumerable Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Gheorghe Păun
    • 1
    • 2
  • Grzegorz Rozenberg
    • 3
  • Arto Salomaa
    • 4
  1. 1.Institute of Mathematics of Romanian AcademyBucharestRomania
  2. 2.Research Group on Natural Computing, Department of Computer Science and Artificial IntelligenceSevilla UniversitySevillaSpain
  3. 3.Leiden Institute of Advanced Computer ScienceUniversity of LeidenLeidenThe Netherlands
  4. 4.Turku Centre of Computer ScienceTurkuFinland

Personalised recommendations