Iterated Hairpin Completions of Non-crossing Words
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.
KeywordsSingle Strand Regular Language Minimal Index Hairpin Formation Hamiltonian Path Problem
Unable to display preview. Download preview PDF.
- 3.Cheptea, D., Martín-Vide, C., Mitrana, V.: A new operation on words suggested by DNA biochemistry: Hairpin completion. Transgressive Computing, 216–228 (2006)Google Scholar
- 5.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)Google Scholar
- 6.Hopcroft, J.E., Ulman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
- 11.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) Google Scholar
- 12.Kari, L., Kopecki, S., Seki, S.: Iterated Hairpin Completions of Non-crossing Words in arXiv:1110.0760Google Scholar
- 20.Sakamoto, K., Kiga, D., Komiya, K., Gouzu, H., Yokoyama, S., Ikeda, S., Hagiya, M.: State transitions by molecules (1998)Google Scholar
- 23.Winfree, E.: Whiplash PCR for O(1) computing. pp. 175–188. University of Pennsylvania (1998)Google Scholar