Some remarks on the hairpin completion

Florin Manea, Victor Mitrana, Takashi Yokomori

    Research output: Contribution to journalArticle

    10 Citations (Scopus)

    Abstract

    We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.

    Original languageEnglish
    Pages (from-to)859-872
    Number of pages14
    JournalInternational Journal of Foundations of Computer Science
    Volume21
    Issue number5
    DOIs
    Publication statusPublished - 2010 Oct

    Fingerprint

    Formal languages

    Keywords

    • DNA computing
    • hairpin completion
    • regular languages

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)

    Cite this

    Some remarks on the hairpin completion. / Manea, Florin; Mitrana, Victor; Yokomori, Takashi.

    In: International Journal of Foundations of Computer Science, Vol. 21, No. 5, 10.2010, p. 859-872.

    Research output: Contribution to journalArticle

    Manea, Florin ; Mitrana, Victor ; Yokomori, Takashi. / Some remarks on the hairpin completion. In: International Journal of Foundations of Computer Science. 2010 ; Vol. 21, No. 5. pp. 859-872.
    @article{b9270c526e744691b16ad2cb0d5023f6,
    title = "Some remarks on the hairpin completion",
    abstract = "We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.",
    keywords = "DNA computing, hairpin completion, regular languages",
    author = "Florin Manea and Victor Mitrana and Takashi Yokomori",
    year = "2010",
    month = "10",
    doi = "10.1142/S0129054110007593",
    language = "English",
    volume = "21",
    pages = "859--872",
    journal = "International Journal of Foundations of Computer Science",
    issn = "0129-0541",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "5",

    }

    TY - JOUR

    T1 - Some remarks on the hairpin completion

    AU - Manea, Florin

    AU - Mitrana, Victor

    AU - Yokomori, Takashi

    PY - 2010/10

    Y1 - 2010/10

    N2 - We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.

    AB - We consider several problems regarding the iterated or non-iterated hairpin completion of some subclasses of regular languages. Thus we obtain a characterization of the class of regular languages as the weak-code images of the k-hairpin completion of center-disjoint k-locally testable languages in the strict sense. This result completes two results from [3] and [11]. Then we investigate some decision problems and closure properties of the family of the iterated hairpin completion of singleton languages. Finally, we discuss some algorithms regarding the possibility of computing the values of k such that the non-iterated or iterated k-hairpin completion of a given regular language does not produce new words.

    KW - DNA computing

    KW - hairpin completion

    KW - regular languages

    UR - http://www.scopus.com/inward/record.url?scp=77957796757&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77957796757&partnerID=8YFLogxK

    U2 - 10.1142/S0129054110007593

    DO - 10.1142/S0129054110007593

    M3 - Article

    VL - 21

    SP - 859

    EP - 872

    JO - International Journal of Foundations of Computer Science

    JF - International Journal of Foundations of Computer Science

    SN - 0129-0541

    IS - 5

    ER -