DNA implementation of simple Horn clause computation

In this paper, we propose a method for biologically implementing simple Boolean formulae. This method enables us to compute the logical consequences of a given set of simple Horn clauses in parallel and takes advantage of the potentially huge number of molecular CPUs in DNA computers. Further, we show that the method can be nicely applied to the parallel implementation of a grammatical recognition algorithm which is based on 'dynamic programming'.