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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonizzoni, P., Mauri, G.: Regular splicing languages and subclasses. Theoret. Comput. Sci. 340, 349–363 (2005)
Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Appl. Math. 31, 261–277 (1991)
Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
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)
Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biology 49, 737–759 (1987)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Loos, R.: An alternative definition of splicing. Theoret. Comput. Sci. (to appear)
Loos, R., Ogihara, M.: A complexity theory for splicing systems (submitted, 2006)
Paun, G.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics 1(1), 27–36 (1996)
Paun, G., Rozenberg, G., Salomaa, A.: DNA computing - New computing paradigms. Springer, Berlin (1998)
Pixton, D.: Regularity of Splicing Languages. Discrete Appl. Math. 69, 101–124 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)