Parallel communicating Watson-Crick automata systems

Czeizler Elena and Czeizler Eugen: Parallel communicating Watson-Crick automata systems. In: Acta cybernetica, (17) 4. pp. 685-700. (2006)

[thumbnail of Czeizler_2006_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (171kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 4
ISSN: 0324-721X
Page Range: pp. 685-700
Language: English
Place of Publication: Szeged
Event Title: International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 699-700. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 15. 13:49

Actions (login required)

View Item View Item