Arithmetical Analysis of Biomolecular Finite Automaton | Zendy

Tadeusz Krasiński | Zendy; Sebastian Sakowski | Zendy; Jacek Waldmajer | Zendy; Tomasz Popławski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Arithmetical Analysis of Biomolecular Finite Automaton

Author(s) -

Tadeusz Krasiński,

Sebastian Sakowski,

Jacek Waldmajer,

Tomasz Popławski

Publication year - 2013

Publication title -

fundamenta informaticae

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.311

H-Index - 67

eISSN - 1875-8681

pISSN - 0169-2968

DOI - 10.3233/fi-2013-953

Subject(s) - arithmetic function , automaton , computer science , deterministic automaton , deterministic finite automaton , finite state machine , theoretical computer science , mathematics , discrete mathematics , algorithm

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research