Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata

HTML  XML Download Download as PDF (Size: 184KB)  PP. 26-34  
DOI: 10.4236/am.2013.410A1005    3,599 Downloads   5,494 Views  Citations

ABSTRACT

Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.

Share and Cite:

K. Ray, K. Chatterjee and D. Ganguly, "Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata," Applied Mathematics, Vol. 4 No. 10A, 2013, pp. 26-34. doi: 10.4236/am.2013.410A1005.
Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.