Information Processing Letters
Aspects of classical language theory
Handbook of formal languages, vol. 1
On the degree of communication in parallel communicating finite automata systems
Journal of Automata, Languages and Combinatorics
Some undecidable problems for parallel communicating finite automata systems
Information Processing Letters
Gene assembly in ciliates: computing by folding and recombination
A half-century of automata theory
Finite-State Language Processing
Finite-State Language Processing
On some operations on strings suggested by gene assembly in ciliates
New Generation Computing
Reversible Molecular Computation in Ciliates
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Szilard Languages Associated to Parallel Communicating Grammar Systems
Szilard Languages Associated to Parallel Communicating Grammar Systems
| Hi-index | 0.00 |
Watson-Crick Automata are a counterpart of finite automata working on a Watson-Crick tape composed of double stran-ded sequences of symbols linked by a complementarity relation like DNA molecules. Consequently, these devices have as input double strands of strings of symbols arranged in a pairwise affinity similar to Watson-Crick complementarity given by the pairs of nucleotides (A, T) and (C, G) of the DNA alphabet. They have been created in order to investigate the behaviour of DNA molecules.Parallel Communicating Finite Automata Systems are accepting devices composed of two or more finite automata that work in parallel in a synchronized manner, communicating states to each other by request. The protocol of collaboration is controlled by the so-called query symbols. They impose restrictions in the communication process (they specify which automaton has to provide its current state to the automaton that asked for the information). Depending on this protocol several variants of parallel communicating finite automata systems have been introduced in the literature, e.g. returning or not returning, centralized or not.In this paper we prove that Watson-Crick automata and parallel communicating finite automata systems with two components are equivalent from a computational point of view. This statement does not depend on the type of the system protocol. We use this result in solving two open problems that concern the characterization of recursively enumerable languages with parallel communicating devices. Several examples, given at the end of the paper, illustrate possible application of the above systems in DNA computing, more exactly in the process of gene assembly in ciliates.