Polynomial-time MAT learning of C-Deterministic Context-free Grammars

スポンサーリンク

概要

• 論文の詳細を見る

• This paper concerns the learning of context-free grammars, and introduces a subclass which we call context-deterministic (c-deterministic) grammars. The corresponding language class properly contains the classes of regular languages and of even linear languages, and is incomparable to the classes of simple deterministic languages and of one-counter languages. We show that the class of cdeterministic grammars is learnable in polynomial time from (extended) minimally adequate teacher (MAT), which gives a generalization of the corresponding results on regular languages in Ref. 3) and even-linear languages in Ref.9).

• 一般社団法人情報処理学会の論文
• 1993-03-15

著者

• SHIRAKAWA Hiromi

  Department of Informatics, Sanno College

• Yokomori T

  Univ. Electro‐communications Chofu‐shi Jpn

• Yokomori Takashi

  Departmant of Computer Science and Information Mathematics, University of Electro-Communications

• Shirakawa Hiromi

  Department Of Informatics Sanno College

関連論文

• Polynomial-time MAT Learning of C-Deterministic Context-free Grammars
• Polynomial-time MAT learning of C-Deterministic Context-free Grammars
• Polynomial-time MAT Learning of C-Deterministic Context-free Grammars

スポンサーリンク