Chinese Journal of Computers   Full Text
Title	Biomolecular Pushdown Automaton Based on the DNA Computing
Authors	ZHANG Zheng1) LIU Jie2) SHI Xiao-Long1)
Address	1)(Department of Control Science and Engineering, Huazhong University of Science & Technology, Wuhan 430074) 2)(Institute of Material Science and Engineering, Huazhong University of Science & Technology, Wuhan 430074)
Year	2008
Issue	No.12(2168—2172)
Abstract &   Background	Abstract DNA computing aims at using nucleic acids for computing. DNA solutions can act as billions of parallel nanoprocessors with few consume. A biomolecular finite automaton has been realized by Benenson in 2001, and the programmable biomolecular pushdown store based the DNA computing is available too. This pushdown store can self assemble with certain logical. In this paper, a simple biomolecular pushdown automaton is constructed with a finite automaton and a pushdown store firstly, and an algorithm is designed to solve a kind of languages. In addition, two improved pushdown automata are designed to solve some problems exiting in the original pushdown store. One of them can accept input string with infinite symbols in theory, and the other can uniform the input symbol. The pushdown automata described in this paper are more powerful than the existing finite automaton in computing theory. Keywords biomolecular pushdown automaton; DNA computing