Solving SAT and HPP with Accepting Splicing Systems
In this paper, we present a different look on splicing systems, namely as problem solvers. After defining the concept of accepting splicing system we discuss how these systems can be used as problem solvers. Then we construct an accepting splicing system able to uniformly solve SAT in time O(m+n) for a formula of length m over n variables. We also propose a uniform solution based on accepting splicing systems to HPP that runs in time O(n), where n is the number of vertices of the instance of HPP.
KeywordsTuring Machine Problem Solver Regular Language Hamiltonian Path Conjunctive Normal Form
Unable to display preview. Download preview PDF.
- 4.Harju, T., Margenstern, M.: Splicing systems for universal Turing machines. In: Milan, C.F., et al. (eds.) Proc. 10th Internat. Meeting on DNA Based Computers, DNA10. LNCS, vol. 3384, pp. 151–160. Springer, Heidelberg (2005)Google Scholar
- 7.Loos, R.: An alternative definition of splicing. Theoret. Comput. Sci. (to appear)Google Scholar
- 8.Loos, R., Ogihara, M.: A complexity theory for splicing systems (submitted, 2006)Google Scholar