The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages

Authors:
Satoshi Okawa;Sadaki Hirose
Affiliations:
The author is with the Faculty of Computer Science and Engineering, The University of Aizu, Aizu-Wakamatsu-shi, 965--8580 Japan. E-mail: okawa@u-aizu.ac.jp,;The author is with the Faculty of Engineering, University of Toyama, Toyama-shi, 930--8555 Japan. E-mail: hirose@iis.toyama-u.ac.jp
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 2

Learning Context-Sensitive Languages from Linear Structural Information

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
On Watson-Crick automata

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Watson-Crick automata were introduced as a new computer model and have been intensively investigated regarding their computational power. In this paper, aiming to establish the relations among language families defined by Watson-Crick automata and the family of context-free languages completely, we obtain the following results. (1) F1WK = FSWK = FWK, (2) FWK = AWK, (3) there exists a language which is not context-free but belongs to NWK, and (4) there exists a context-free language which does not belong to AWK.