Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel Communicating Watson-Crick Automata Systems (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Czeizler, Elena Czeizler, Eugen |
| Description | Watson-Crick automata are finite state automata working on doublestranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper we introduce the concept of parallel communicating Watson-Crick automata systems. It consists of several Watson-Crick finite automata parsing independently the same input and exchanging information on request, by communicating states to each other. We investigate the computational power of these systems and prove that they are more powerful than classical Watson-Crick finite automata, but still accepting at most context-sensitive languages. Moreover, if the complementarity relation is injective, then we obtain that this inclusion is strict. For the general case, we also give some closure properties, as well as a characterization of recursively enumerable languages based on these systems. 1 |
| File Format | |
| Language | English |
| Publisher Date | 2005-01-01 |
| Publisher Institution | Proceedings of Automata and Formal Languages (Dobogókő |
| Access Restriction | Open |
| Subject Keyword | Watson-crick Automaton System Classical Watson-crick Finite Automaton Dna Molecule Closure Property Computational Power Finite State Automaton Several Watson-crick Finite Automaton Context-sensitive Language Enumerable Language General Case Parallel Communicating Watson-crick Automaton System Complementarity Relation Doublestranded Tape Watson-crick Automaton |
| Content Type | Text |
| Resource Type | Article |
