Inferring Parenthesis Linear Grammars Based on Control Sets

スポンサーリンク

概要

• 論文の詳細を見る

• We provide a new grammatical inference method for a class of linear grammars, called parenthesis linear grammars. We first show that any linear language can be generated by a fixed linear grammar together with a regular control set. From this, it is shown that the inference problem for parenthesis linear grammars can be reduced to the problem for regular sets. This implies that to infer parenthesis linear grammars, we can use any inference algorithm for regular sets. An application of our results to the inference problem for generalized sequenctial machines is also discussed.

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

著者

• Takada Yuji

  International Institute For Advanced Study Of Social Information Science (iias-sis) Fujitsu Limited

関連論文

• On Learning Equal Matrix Languages
• Inferring Parenthesis Linear Grammars Based on Control Sets

スポンサーリンク