<テクニカルレポート>
Polynomial Time Learnability of Deterministic Right Linear Translations

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 This paper is concerned with the problem of learning translations from minimally adequate teacher. A translation considered here is a binary relation over strings and defined by an elementary formal s...ystem (EFS, for short) in a special form. An EFS consists of several predicates, in general, but the defined translation is directly characterized by only one designated predicate in them. This means that every other predicates, which are indirectly necessary for defining the translation, are never ohserved in the interaction between a teacher and a learner. The main problem investigated in this paper is how to inventing such unobserved predicates and to complete learning. The presented algorithm learns successfully the target EFS inventing such auxiliary predicates via membership and equivalence queries in polynomial time.続きを見る

本文情報を非表示

rifis-tr-120 pdf 1.11 MB 56  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2017.01.20