A note on the descriptional complexity of semi-conditional grammars

研究成果: Contribution to journalArticle査読

11 被引用数 (Scopus)

抄録

The descriptional complexity of semi-conditional grammars (SCG) has been presented. Semi-conditional grammars (SCG) are context-free grammars with a permitting and a forbidding condition associated to each production. The class of recursively enumerable languages is characterized by SCGs of degree with six conditional productions and seven non terminals. It is proved that the class of recursively enumerable languages is characterized by simple SCGs of degree with eight conditional productions and nine non terminals. Simple semi-conditional grammars of degree with erasing productions characterize the class of recursively enumerable languages and the classes of languages generated by simple semi-conditional grammars of degree and with erasing productions are included in the class of recursive languages.

本文言語英語
ページ(範囲)36-40
ページ数5
ジャーナルInformation Processing Letters
110
1
DOI
出版ステータス出版済み - 12 1 2009
外部発表はい

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 信号処理
  • 情報システム
  • コンピュータ サイエンスの応用

フィンガープリント

「A note on the descriptional complexity of semi-conditional grammars」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル