Handbook of Formal Languages
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Journal of Automata, Languages and Combinatorics
On partially blind multihead finite automata
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
IBM Journal of Research and Development
The role of the complementarity relation in watson-crick automata and sticker systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Two-party Watson-Crick computations
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Hi-index | 5.23 |
Watson-Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity of Watson-Crick automata initiated by Paun et al. [A. Paun, M. Paun, State and transition complexity of Watson-Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Fundamentals of Computation Theory, FCT'99, in: LNCS, vol. 1684, 1999, pp. 409-420]. In particular, we show that any finite language, as well as any unary regular language, can be recognized by a Watson-Crick automaton with only two, and respectively three, states. Also, we formally define the notion of determinism for these systems. Contrary to the case of non-deterministic Watson-Crick automata, we show that, for deterministic ones, the complementarity relation plays a major role in the acceptance power of these systems.