The role of the complementarity relation in watson-crick automata and sticker systems

Authors:
Dietrich Kuske;Peter Weigel
Affiliations:
Institut für Algebra, Technische Universität Dresden, Dresden, Germany;Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, Halle, Germany
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 3
Cited 3

Watson-Crick walks and roads on DOL graphs

Acta Cybernetica
DNA Computing, Matching Systems, and Universality

DNA Computing, Matching Systems, and Universality
Watson-Crick ω-automata

Journal of Automata, Languages and Combinatorics

On the power of parallel communicating Watson-Crick automata systems

Theoretical Computer Science
On the descriptional complexity of Watson-Crick automata

Theoretical Computer Science
5′ → 3′ Watson-Crick Automata With Several Runs

Fundamenta Informaticae - Non-Classical Models of Automata and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [4, page166], it is asked what influence the complementarity relation plays as far as the expressiveness of sticker systems and Watson-Crick automata are concerned. Here, we give the answer: (almost) none! More precisely, we show that every language L of a sticker system or a Watson-Crick automaton is the language of such a system with a one-to-one complementarity relation. Our second group of results shows that L is the inverse block coding of a language from the same family over any nontrivial fixed complementarity relation. Finally, we prove that any Watson-Crick automaton can be transformed into an equivalent simple and all-final one. This implies the collapse of parts of the hierarchy introduced in [4].