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*

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

研究成果: Article査読

16 被引用数 (Scopus)

抄録

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy 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-Schützenberger 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
ページ(範囲)859-871
ページ数13
ジャーナルInternational Journal of Foundations of Computer Science
19
4
DOI
出版ステータスPublished - 2008 8月
外部発表はい

ASJC Scopus subject areas

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

フィンガープリント

「Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル