### 抜粋

This paper introduces the class of concatenations of locally testable languages and its subclasses, and presents some results on the learnability of the classes from positive data. We first establish several relationships among the language classes introduced, and give a sufficient condition for a concatenation operation to preserve finite elasticity of a language class C. Then we show that, for each k, the class CLT^{≤k}, a subclass of concatenations of locally testable languages, is identifiable in the limit from positive data. Further, we introduce a notion of local parsability, and define a class (k, l)-CLTS, which is a subclass of the class of concatenations of strictly locally testable languages. Then, for each k, l ≥ 1, (k, l)-CLTS is proved to be identifiable in the limit from positive data using reversible automata with the conjectures updated in polynomial time. Some possible applications of this result are also briefly discussed.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Algorithmic Learning Theory - 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994, Proceedings |

編集者 | Setsuo Arikawa, Klaus P. Jantke |

出版者 | Springer Verlag |

ページ | 407-422 |

ページ数 | 16 |

ISBN（印刷物） | 9783540585206 |

DOI | |

出版物ステータス | Published - 1994 |

イベント | 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994 - Reinhardsbrunn Castle, Germany 継続期間: 1994 10 10 → 1994 10 15 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 872 LNAI |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### Other

Other | 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994 |
---|---|

国 | Germany |

市 | Reinhardsbrunn Castle |

期間 | 94/10/10 → 94/10/15 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## フィンガープリント Learning concatenations of locally testable languages from positive data' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Algorithmic Learning Theory - 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994, Proceedings*(pp. 407-422). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 872 LNAI). Springer Verlag. https://doi.org/10.1007/3-540-58520-6_80