Associate languages and derivational complexity of formal grammars and languages

Etsuro Moriya

研究成果: Article

42 引用 (Scopus)

抜粋

A criterion to measure derivational complexity of formal grammars and languages is proposed and discussed. That is, the associate language and the L-associate language are defined for a grammar such that the former represents all the valid derivations and the latter represents all the valid leftmost derivations. It is shown that for any phrase\3-structure grammar, the associate language is a contex\3-sensitive language and the L\3-associate language is a context\3-free language. Necessary and sufficient conditions for an associate language to be a regular set and to be a context\3-free language are found. The idea in the above necessary and sufficient conditions is extended to the notion of "rank≓ for a measure of derivational complexity of context\3-free grammars and languages. It is shown that for each nonnegative integer k, there exists a context\3-free language whose rank is k. The paper also includes a few solvable decision problems concerning derivational complexity of grammars.

元の言語English
ページ(範囲)139-162
ページ数24
ジャーナルInformation and control
22
発行部数2
DOI
出版物ステータスPublished - 1973
外部発表Yes

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント Associate languages and derivational complexity of formal grammars and languages' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用