Copyright © 2006 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Automata and Formal Language Theory |
The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages
1 The author is with the Faculty of Computer Science and Engineering, The University of Aizu, Aizu-Wakamatsu-shi, 9658580 Japan. E-mail: okawa{at}u-aizu.ac.jp, 2 The author is with the Faculty of Engineering, University of Toyama, Toyama-shi, 9308555 Japan. E-mail: hirose{at}iis.toyama-u.ac.jp
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.
Key Words: DNA computer, Watson-Crick automata, formal languages, language family
Manuscript received November 28, 2005. Manuscript revised April 7, 2006.