講演抄録/キーワード |
講演名 |
2014-12-05 15:25
Homomorphism-Substitutable Context-free Languages and Learning Algorithm ○Takayuki Kuriyama(Sokendai/ NII) COMP2014-38 |
抄録 |
(和) |
We generalized the class of $k,l$-substitutable languages (Yoshinala, 2008). Each language in the generalized class is closed under a good substitutability. The substitutability depends on the value of a fixed homomorphism. And we show the convergence of our generalized learning algorithm. The size of the characteristic sample is smaller than Yoshinaka's. |
(英) |
We generalized the class of $k,l$-substitutable languages (Yoshinala, 2008). Each language in the generalized class is closed under a good substitutability. The substitutability depends on the value of a fixed homomorphism. And we show the convergence of our generalized learning algorithm. The size of the characteristic sample is smaller than Yoshinaka's. |
キーワード |
(和) |
/ / / / / / / |
(英) |
Context-free languages / Grammatical inference / Identification in the Limit / Learning algorithms from text / Approximate learning / Substitutable languages / Formal languages / |
文献情報 |
信学技報, vol. 114, no. 352, COMP2014-38, pp. 37-44, 2014年12月. |
資料番号 |
COMP2014-38 |
発行日 |
2014-11-28 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2014-38 |