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.
Highlights
In this paper we addressed some aspects of the languages defined by Watson-Crick finite automata (WKFA) where the delay between the two strands in obtaining the upper strings is bounded
It allows us to establish a result that limits the computational capacity of the WKFA model, i.e., by introducing a bounded delay, we are reducing the class of languages that the model is able to accept
Another aspect we want to highlight is that the study of language families characterized by bounded delays is a prior step to establishing efficient methods for their inductive inference, that is the application of machine learning techniques to obtain DNA computational models
Summary
Another computation model proposed in the DNA computing framework was the sticker systems [9] The characteristics of this model are similar to WKFA (double strands and complementarity) but within a generative approach. We consider that the length of the primers of the double strand during the computation time, does not exceed a predefined positive integer value We can impose this feature in the computations performed during the application of transitions in the WKFA, as is the case in the delayed computations of sticker systems [10], or we can define it explicitly in the transitions of the model. We finish our work with some conclusions and future work on the topic addressed in this work
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
