Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
In Vitro Implementation of Finite-State Machines
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Splicing Systems, Aqueous Computing, and Beyond
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Similarity-based fuzzy reasoning by DNA computing
International Journal of Bio-Inspired Computation
International Journal of Wireless and Mobile Computing
Reasoning with disposition using DNA tweezers
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
In this paper, we have developed a Turing machine or a finite automaton, which scans the input data tape in form of DNA sequences and inspires the basic design of DNA computer. This model based on splicing system can solve fuzzy reasoning autonomously by using DNA sequences and human assisted protocols. Its hardware consists of class IIS restriction enzyme and T4 DNA ligase while the software consists of double stranded DNA sequences and transition molecules which are capable of encoding fuzzy rules. Upon mixing solutions containing these components, the automaton undergoes a cascade of cleaving and splicing cycles to produce the computational result in form of double stranded DNA sequence representing automaton's final state. In this work, we have fused the idea of splicing system with the automata theory to develop fuzzy molecular automaton in which 1018 processors can work in parallel, requires a trillion times less space for information storage, 105 times faster than existing super computer and 1019 power operations can be performed using 1 Joule of energy.