Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy(Automata and Formal Language Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• Watson-Crick automata, recently introduced in [1], are new types of automata in the DNA computing framework, working on tapes which are double stranded sequences of symbols related by a complementarity relation, similar to a DNA molecule. The automata scan separately each of the two strands in a corelated mannar. Some restricted variants of them were also introduced and the relationship between the families of languages recognized by them were investigated in [1]-[4]. In this paper, we clarify some relations between the families of languages recognized by the restricted variants of Watson-Crick finite automata and the families in the Chomsky hierarchy.

• 社団法人電子情報通信学会の論文
• 2004-05-01

著者

• Kimura Haruhiko

  Faculty Of Engineering Kanazawa University

• HIROSE Sadaki

  Faculty of Engineering, Toyama University

• Hirose Sadaki

  Faculty Of Engineering Toyama University

• TSUDA Kunifumi

  Faculty of Engineering, Toyama University

• OGOSHI Yasuhiro

  Faculty of Engineering, Toyama University

• Tsuda Kunifumi

  Faculty Of Engineering Toyama University

• Ogoshi Yasuhiro

  Faculty Of Engineering Toyama University

関連論文

• Air Purification Capability of Charcoal and Its Evaluation
• Control Methods of Genetic Algorithms under Changing Environments
• High Speed Hypothetical Reasoning System with Case-Based Reasoning for Diagnosing Faults
• Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy(Automata and Formal Language Theory)
• On Computational Power of Insertion-Deletion Systems without Using Contexts(Automata and Formal Language Theory)
• The Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays
• The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages(Automata and Formal Language Theory)

スポンサーリンク