Some remarks on the hairpin completion

Florin Manea*, Victor Mitrana, Takashi Yokomori

*この研究の対応する著者

研究成果: Article査読

10 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)859-872
ページ数14
ジャーナルInternational Journal of Foundations of Computer Science
21
5
DOI
出版ステータスPublished - 2010 10月
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンス(その他)

フィンガープリント

「Some remarks on the hairpin completion」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル