scispace - formally typeset
Search or ask a question
Journal ArticleDOI

On the Languages Accepted by Watson-Crick Finite Automata with Delays

09 Apr 2021-Vol. 9, Iss: 8, pp 813
TL;DR: This work analyzes the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed and proves that the language class accepted by WKFA with such restrictions is a proper subclass of the languages accepted by arbitrary WK FA in general.
Abstract: In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over the transition function in the model are imposed. We consider that the restrictions imposed refer to the maximum length difference between the two input strands which is called the delay. We prove that the language class accepted by WKFA with such restrictions is a proper subclass of the languages accepted by arbitrary WKFA in general. In addition, we initiate the study of the language classes characterized by WKFAs with bounded delays. We prove some of the results by means of various relationships between WKFA and sticker systems.
References
More filters
Book
01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Abstract: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.

13,779 citations

BookDOI
01 Apr 1997
TL;DR: This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field.
Abstract: The theory of formal languages is the oldest and most fundamental area of theoretical computer science. It has served as a basis of formal modeling from the early stages of programming languages to the recent beginnings of DNA computing. This first handbook of formal languages gives a comprehensive up-to-date coverage of all important aspects and subareas of the field. Best specialists of various subareas, altogether 50 in number, are among the authors. The maturity of the field makes it possible to include a historical perspective in many presentations. The individual chapters can be studied independently, both as a text and as a source of reference. The Handbook is an invaluable aid for advanced students and specialists in theoretical computer science and related areas in mathematics, linguistics, and biology.

1,915 citations

Journal ArticleDOI
TL;DR: Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata, and one variant is proven to be equivalent to Turing machines.
Abstract: We introduce the sticker systems, a computability model, which is an abstraction of the computations using the Watson-Crick complementarity as in Adleman's DNA computing experiment, [1]. Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata. One variant is proven to be equivalent to Turing machines. Another one is found to have a strictly intermediate power.

110 citations

Journal ArticleDOI
TL;DR: Characterizations of regular, linear, and recursively enumerable languages are obtained in this framework of sticker systems, an abstraction of the way that the WatsonCrick complementarity is used in DNA computing.

42 citations

Journal Article
TL;DR: This paper concentrates on the computational power, complexity measures, decidability problems, and systems of Watson-Crick automata working together on the same input.
Abstract: This paper surveys some known results in Watson-Crick automata theory. In particular, we concentrate on the computational power, complexity measures, decidability problems, and systems of Watson-Crick automata working together on the same input. This selection of topics is not exhaustive, reflecting the research interests of the authors. A series of open problems and questions is also included.

38 citations