Abstract
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive language and for some words it is known to be non-context-free. However, it is unknown whether regularity of iterated hairpin completion of a given word is decidable. Also the question whether iterated hairpin completion of a word can be context-free but not regular was asked in literature. In this paper we investigate iterated hairpin completions of non-crossing words and, within this setting, we are able to answer both questions. For non-crossing words we prove that the regularity of iterated hairpin completions is decidable and that if iterated hairpin completion of a non-crossing word is not regular, then it is not context-free either.
This research was supported by the Natural Sciences and Engineering Research Council of Canada Discovery Grant R2824A01 and Canada Research Chair Award to L., K., and by the Funding Program for Next Generation World-Leading Researchers (NEXT Program) to Yasushi Okuno, the current supervisor of S., S.
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
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1024 (1994)
Arita, M., Kobayashi, S.: DNA sequence design using templates. New Generation Computing 20, 263–277 (2002)
Cheptea, D., Martín-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: Hairpin completion. Transgressive Computing, 216–228 (2006)
Diekert, V., Kopecki, S.: Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 105–114. Springer, Heidelberg (2011)
Hagiya, M., Arita, M., Kiga, D., Sakamoto, K., Yokoyama, S.: Towards parallel evaluation and learning of boolean μ-formulas with molecules. In: Second Annual Genetic Programming Conf., pp. 105–114 (1997)
Hopcroft, J.E., Ulman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA codewords. Congressus Numerantium 156, 99–110 (2002)
Jonoska, N., Mahalingam, K.: Languages of DNA Based Code Words. In: Chen, J., Reif, J. (eds.) DNA 2003. LNCS, vol. 2943, pp. 61–73. Springer, Heidelberg (2004)
Kameda, A., Yamamoto, M., Ohuchi, A., Yaegashi, S., Hagiya, M.: Unravel four hairpins! Natural Computing 7, 287–298 (2008)
Kari, L., Konstantinidis, S., Losseva, E., Sosík, P., Thierrin, G.: A formal language analysis of DNA hairpin structures. Fundamenta Informaticae 71(4), 453–475 (2006)
Kari, L., Kopecki, S., Seki, S.: On the regularity of iterated hairpin completion of a single word. Fundamenta Informaticae 110(1-4), 201–215 (2011)
Kari, L., Kopecki, S., Seki, S.: Iterated Hairpin Completions of Non-crossing Words in arXiv:1110.0760
Kopecki, S.: On iterated hairpin completion. Theoretical Computer Science 412(29), 3629–3638 (2011)
Manea, F.: A series of algorithmic results related to the iterated hairpin completion. Theor. Comput. Sci. 411(48), 4162–4178 (2010)
Manea, F., Martín-Vide, C., Mitrana, V.: On some algorithmic problems regarding the hairpin completion. Discrete Applied Mathematics 157(9), 2143–2152 (2009)
Manea, F., Mitrana, V.: Hairpin Completion Versus Hairpin Reduction. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 532–541. Springer, Heidelberg (2007)
Manea, F., Mitrana, V., Yokomori, T.: Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. Theor. Comput. Sci. 410(4-5), 417–425 (2009)
Manea, F., Mitrana, V., Yokomori, T.: Some remarks on the hairpin completion. Int. J. Found. Comput. Sci. 21(5), 859–872 (2010)
Păun, G., Rozenberg, G., Yokomori, T.: Hairpin languages. International Journal of Foundations of Computer Science 12(6), 837–847 (2001)
Sakamoto, K., Kiga, D., Komiya, K., Gouzu, H., Yokoyama, S., Ikeda, S., Hagiya, M.: State transitions by molecules (1998)
Takinoue, M., Suyama, A.: Molecular reactions for a molecular memory based on hairpin DNA. Chem-Bio Informatics Journal 4, 93–100 (2004)
Takinoue, M., Suyama, A.: Hairpin-DNA memory using molecular addressing. Small 2(11), 1244–1247 (2006)
Winfree, E.: Whiplash PCR for O(1) computing. pp. 175–188. University of Pennsylvania (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kari, L., Kopecki, S., Seki, S. (2012). Iterated Hairpin Completions of Non-crossing Words. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-27660-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27659-0
Online ISBN: 978-3-642-27660-6
eBook Packages: Computer ScienceComputer Science (R0)