### 抜粋

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 20 → 2007 7 22 |

### 出版物シリーズ

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

### Conference

Conference | 9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007 |
---|---|

国 | Slovakia |

市 | High Tatras |

期間 | 07/7/20 → 07/7/22 |

### ASJC Scopus subject areas

- Software

## フィンガープリント 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.