6533b7d4fe1ef96bd1263460

RESEARCH PRODUCT

Arithmetical Analysis of Biomolecular Finite Automaton

Tadeusz KrasińskiSebastian SakowskiJacek WaldmajerTomasz Poplawski

subject

Algebra and Number TheoryContinuous automatonPushdown automatonBüchi automatonBiomolecular computerTheoretical Computer ScienceDNA automatonDNA computingAlgebraElementary cellular automatonDeterministic finite automatonComputational Theory and MathematicsDeterministic automatonProbabilistic automatonTwo-way deterministic finite automatonInformation SystemsMathematics

description

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.

https://doi.org/10.3233/fi-2013-953