Typed pattern languages and their learnability

研究成果: Conference contribution

9 引用 (Scopus)

抜粋

In this paper, we extend patterns, introduced by Angluin [Ang80b], to typed patterns by introducing types into variables. A type is a recursive language and a variable of the type is substituted only with an element in the recursive language. This extension enhances the expressive power of patterns with preserving their good properties. First, we give a general learnability result for typed pattern languages. We show that if a class of types has finite elasticity then the typed pattern language is identifiable in the limit from positive data. Next, we give a useful tool to show the conservative learnability of typed pattern languages. That is, if an indexed family L of recursive languages has recursive finite thickness and the equivalence problem for L is decidable, then L is conservatively learnable from positive data. Using this tool, we consider the following classes of types: (1) the class of all strings over subsets of the alphabet, (2) the class of all untyped pattern languages, and (3) a class of ĸ-bounded regular languages. We show that each of these typed pattern languages is conservatively learnable from positive data.

元の言語English
ホスト出版物のタイトルComputational Learning Theory - 2nd European Conference, EuroCOLT 1995, Proceedings
編集者Paul Vitanyi
出版者Springer Verlag
ページ367-379
ページ数13
ISBN(印刷物)9783540591191
DOI
出版物ステータスPublished - 1995 1 1
外部発表Yes
イベント2nd European Conference on Computational Learning Theory, EuroCOLT 1995 - Barcelona, Spain
継続期間: 1995 3 131995 3 15

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
904
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

Other

Other2nd European Conference on Computational Learning Theory, EuroCOLT 1995
Spain
Barcelona
期間95/3/1395/3/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Typed pattern languages and their learnability' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Koshiba, T. (1995). Typed pattern languages and their learnability. : P. Vitanyi (版), Computational Learning Theory - 2nd European Conference, EuroCOLT 1995, Proceedings (pp. 367-379). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 904). Springer Verlag. https://doi.org/10.1007/3-540-59119-2_192