Extended Shapiro finite state automaton built on DNA

• Autorzy: Krasiński T. , Sakowski S.
• Języki publikacji: EN

Abstrakty

EN

The paper deals with cooperation problems in the case of several parties having different sets of criteria measuring their payoffs. It presents interactive procedures supporting multicriteria analysis and aiding consensus seeking through a mediation process. Using ideas of the cooperative game theory, a mathematical model describing cooperation situations and deriving possible payoffs of parties can be constructed. The model is a base for the analysis made. Solution concepts developed in the cooperative game theory are applied in the mediation process. The procedures can be used in a computer-based system supporting analysis carried on by the parties.

Słowa kluczowe

EN

finite automaton; DNA computing

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2008
• Tom: Vol. 33, No. 3
• Strony: 241--255
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Krasiński T.

autor

Sakowski S.

• Faculty of Mathematics and Computer Science, University of Łódź, Łódź, Poland

Bibliografia

• [1]Adleman, L.: Molecular computation of solutions to combinatorial problems. Science, 226, 1994, 1021-1024.
• [2]Amos, M.: Theoretical and Experimental DNA Computation. Springer. Berlin, Heidelberg, New York, 2005.
• [3]Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine made of biomolecules. Nature, 414, 2001,430-434.
• [4]Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., Shapiro, E.: DNA molecule provides a computing machine with both data and fuel. PNAS, 100, 2003, 2191-2196.
• [5]Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979.
• [6]Krasiriski, T., Sakowski, S.: A theoretical model of the Shapiro finite state automaton built on DNA. Theoretical and Applied Informatics 18 (3), 2006, 161-174.
• [7]Paun, G., Rozenberg G., Salomaa, A.: DNA Computing. New Computing Paradigma.Springer. Berlin, Heidelberg, New York 1998.
• [8]Rothemund, P.: A DNA and restriction enzyme implementation of Turing machines. In DNA Based Computers, Amer. Math. Soc. 1995, 75-119.
• [9]Soloveichik, D., Winfree, E.: The computational power of Benenson automaton.Theoretical Computer Science, 344, 2005, 279-297.
• [10]Soreni, M., Yogev, S., Kossoy, E., Shoham, Y. and Keinan, E.: Parallel biomolecular computation on surfaces with advanced finite automata. J. Am. Chem. Soc., 127, 2005, 3935-3943.
• [1l]Unold, O., Troc M., Dobosz T., Trusiewicz A.: Extended molecular computing model. WSEAS Trans. Biol. Biomed. 1, 2004, 15-19.
• [12]Restriction Endonucleases. April 2006. <http://www.fermentas.com>.