### 抜粋

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 13 → 1995 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

Other | 2nd European Conference on Computational Learning Theory, EuroCOLT 1995 |
---|---|

国 | Spain |

市 | Barcelona |

期間 | 95/3/13 → 95/3/15 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

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

## これを引用

*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