The Power of Networks of Watson-Crick D0L Systems
The notion of a network of Watson-Crick D0L systems was recently introduced, . It is a distributed system of deterministic language defining devices making use of Watson-Crick complementarity. The research is continued in this paper, where we establish three results about the power of such networks. Two of them show how it is possible to solve in linear time two well-known NP-complete problems, the Hamiltonian Path Problem and the Satisfiability Problem. Here the characteristic feature of DNA computing, the massive parallelism, is used very strongly. As an illustration we use the propositional formula from the celebrated recent paper, . The third one shows how in the very simple case of four-letter DNA alphabets we can obtain weird (not even Z-rational) patterns of population growth.
KeywordsHamiltonian Path Propositional Formula Node Versus Derivation Step Massive Parallelism
Unable to display preview. Download preview PDF.
- 3.Braich, S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution of a 20-variable 3-SAT problem on a DNA computer. Sciencexpress, March 14, 10.1126/science.1069528 (2002)Google Scholar
- 5.Csuhaj-Varjú, E.: Networks of Language Processors. EATCS Bulletin 63, 120–134 (1997); Păun, G., Rozenberg, G., Salomaa, A. (eds.): Current Trends in Theoretical Computer Science, pp. 771–790. World Scientific, Singapore (2001)Google Scholar
- 6.Csuhaj-Varjú, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)Google Scholar
- 7.Csuhaj-Varjú, E., Salomaa, A.: Networks of Watson-Crick D0L systems. TUCS Report 419, Turku Centre for Computer Science, Turku (2001); To appear in Ito, M., Imaoka, T. (eds.): Words, Languages, Combinatorics III. Proceedings of the Third International Colloquium in Kyoto, Japan. World Scientific Publishing Company, Singapore (2003)Google Scholar
- 9.Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1986)Google Scholar