The syntactic monoid of hairpin-free languages

Authors: Kari, Lila¹; Mahalingam, Kalpana²; Thierrin, Gabriel

Source: Acta Informatica, Volume 44, Numbers 3-4, July 2007 , pp. 153-166(14)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is complementary to T and G to C, DNA single strands that are complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable for biocomputation, since it makes the affected DNA string unavailable for future interactions, is the hairpin: if some subsequences of a DNA single string are complementary to each other, the string will bind to itself forming a hairpin-like structure. This paper continues the theoretical study of hairpin-free languages. We study algebraic properties of hairpin-free words and hairpins. We also give a complete characterization of the syntactic monoid of the language consisting of all hairpin-free words over a given alphabet and illustrate it with an example using the DNA alphabet.

Document Type: Research article

DOI: http://dx.doi.org/10.1007/s00236-007-0041-4

Affiliations: 1: Email: lila@csd.uwo.ca 2: Email: kalpana@csd.uwo.ca

Publication date: 2007-07-01