Affiliations: Faculty of Mathematics and Computer Science, University of Łódź, Banacha 22, 90-238 Łódź, Poland. [email protected], [email protected] | Group of Logic, Language and Information, Department of Philosophy, University of Opole, Katowicka 89, 45-061 Opole, Poland. [email protected] | Department of Molecular Genetic, University of Łódź, Pomorska 141/143, 90-236 Łódź, Poland. [email protected]
Note: [] Address for correspondence: Faculty of Mathematics and Computer Science, University of Łódź, Banacha 22, 90-238 Łódź, Poland.
Abstract: In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.
Keywords: Biomolecular computer, DNA automaton, DNA computing
