Solving SAT and HPP with Accepting Splicing Systems

  • Remco Loos
  • Carlos Martín-Vide
  • Victor Mitrana
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4193)


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.


Turing Machine Problem Solver Regular Language Hamiltonian Path Conjunctive Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bonizzoni, P., Mauri, G.: Regular splicing languages and subclasses. Theoret. Comput. Sci. 340, 349–363 (2005)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math. 31, 261–277 (1991)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  4. 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
  5. 5.
    Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biology 49, 737–759 (1987)MATHMathSciNetGoogle Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  7. 7.
    Loos, R.: An alternative definition of splicing. Theoret. Comput. Sci. (to appear)Google Scholar
  8. 8.
    Loos, R., Ogihara, M.: A complexity theory for splicing systems (submitted, 2006)Google Scholar
  9. 9.
    Paun, G.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics 1(1), 27–36 (1996)MATHMathSciNetGoogle Scholar
  10. 10.
    Paun, G., Rozenberg, G., Salomaa, A.: DNA computing - New computing paradigms. Springer, Berlin (1998)MATHGoogle Scholar
  11. 11.
    Pixton, D.: Regularity of Splicing Languages. Discrete Appl. Math. 69, 101–124 (1996)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Remco Loos
    • 1
  • Carlos Martín-Vide
    • 1
  • Victor Mitrana
    • 1
    • 2
  1. 1.Research Group in Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  2. 2.Faculty of Mathematics and Computer ScienceUniversity of BucharestBucharestRomania

Personalised recommendations