Skip to main content
SpringerLink
Log in

Solving SAT and HPP with Accepting Splicing Systems

  • Conference paper
Parallel Problem Solving from Nature - PPSN IX (PPSN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4193))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonizzoni, P., Mauri, G.: Regular splicing languages and subclasses. Theoret. Comput. Sci. 340, 349–363 (2005)

    Article  MathSciNet  Google Scholar 

  2. Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math. 31, 261–277 (1991)

    Article  MathSciNet  Google Scholar 

  3. Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  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. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biology 49, 737–759 (1987)

    Article  MathSciNet  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  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 

  9. Paun, G.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics 1(1), 27–36 (1996)

    MathSciNet  MATH  Google Scholar 

  10. Paun, G., Rozenberg, G., Salomaa, A.: DNA computing - New computing paradigms. Springer, Berlin (1998)

    MATH  Google Scholar 

  11. Pixton, D.: Regularity of Splicing Languages. Discrete Appl. Math. 69, 101–124 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group in Mathematical Linguistics, Rovira i Virgili University, Pça. Imperial Tarraco 1, 43005, Tarragona, Spain

    Remco Loos, Carlos Martín-Vide & Victor Mitrana

  2. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

Authors
  1. Remco Loos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlos Martín-Vide
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Science Institute, University of Iceland, P.O. Box, Iceland

    Thomas Philip Runarsson

  2. Vorarlberg University of Applied Sciences, Hochschulstr. 1, A-6850, Dornbirn, Austria

    Hans-Georg Beyer

  3. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  4. Depto. Arquitectura y Tecnologa de Computadores, ETS Ingeiera Informtica, C/Daniel Saucedo Aranda, s/n, 18071, Granada, Spain

    Juan J. Merelo-Guervós

  5. Colorado State University, 80523, Fort Collins, CO, USA

    L. Darrell Whitley

  6. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loos, R., Martín-Vide, C., Mitrana, V. (2006). Solving SAT and HPP with Accepting Splicing Systems. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_78

Download citation

  • DOI: https://doi.org/10.1007/11844297_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38990-3

  • Online ISBN: 978-3-540-38991-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation