Skip to main content
Conference Proceedings

State and transition complexity of watson-crick finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1684 409-420
DOI: 10.1007/3-540-48321-7_34
17Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider the number of states and the number of transiti­ons 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.

Cite

CITATION STYLE

APA

Păun, A., & Păun, M. (1999). State and transition complexity of watson-crick finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1684, pp. 409–420). Springer Verlag. https://doi.org/10.1007/3-540-48321-7_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free