Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems

Gheorghe Pǎun, Mario J. Pérez-Jiménez, Takashi Yokomori

研究成果: Conference contribution

1 引用 (Scopus)

抜粋

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Scḧutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩D), where is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages - this time using insertion systems of weight (3, 0) and star languages.

元の言語English
ホスト出版物のタイトルDescriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007
出版者Technical University of Kosice
ページ129-140
ページ数12
ISBN(印刷物)9788070976883
出版物ステータスPublished - 2007 1 1
イベント9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007 - High Tatras, Slovakia
継続期間: 2007 7 202007 7 22

出版物シリーズ

名前Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007

Conference

Conference9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007
Slovakia
High Tatras
期間07/7/2007/7/22

ASJC Scopus subject areas

  • Software

フィンガープリント Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Pǎun, G., Pérez-Jiménez, M. J., & Yokomori, T. (2007). Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. : Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007 (pp. 129-140). (Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007). Technical University of Kosice.