On a hierarchy of slender languages based on control sets

Takeshi Koshiba*

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

研究成果: Article査読

抄録

We study slender context-sensitive languages, i.e., those containing at most a constant number of words of each length. Recently, it was proved that every slender regular language can be described by a finite union of terms of the form uviw [9] and every slender context-free language can be described by a finite union of terms of the form uviwxi y [4, 10]. We show a hierarchy of slender languages which is properly contained in the family of context-sensitive languages and which starts with the family of slender context-free languages, or slender regular languages. Each slender context-sensitive language in the hierarchy can be described by a finite union of terms of the form x1y1ix2y2 i⋯xnynixn+1.

本文言語English
ページ(範囲)41-47
ページ数7
ジャーナルFundamenta Informaticae
31
1
DOI
出版ステータスPublished - 1997 7月
外部発表はい

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 代数と数論
  • 情報システム
  • 計算理論と計算数学

フィンガープリント

「On a hierarchy of slender languages based on control sets」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル