### 抜粋

We consider the problem of learning deterministic even linear languages from positive examples. By a “deterministic” even linear language we mean a language generated by an LR(k) even linear grammar. We introduce a natural subclass of LR(k) even linear languages, called LR(k) in the strong sense, and show that this subclass is learn- able in the limit from positive examples. Furthermore, we propose a learning algorithm that identifies this subclass in the limit with almost linear time in updating conjectures. As a corollary, in terms of even Unear grammars, we have a learning algorithm for k-reversible languages that is more efficient than the one proposed by Angluin[Ang82].

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

ホスト出版物のタイトル | Algorithmic Learning Theory - 6th International Workshop, ALT 1995, Proceedings |

出版者 | Springer Verlag |

ページ | 41-54 |

ページ数 | 14 |

巻 | 997 |

ISBN（印刷物） | 3540604545, 9783540604549 |

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

外部発表 | Yes |

イベント | 6th International Workshop on Algorithmic Learning Theory, ALT 1995 - Fukuoka, Japan 継続期間: 1995 10 18 → 1995 10 20 |

### 出版物シリーズ

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

巻 | 997 |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### Other

Other | 6th International Workshop on Algorithmic Learning Theory, ALT 1995 |
---|---|

国 | Japan |

市 | Fukuoka |

期間 | 95/10/18 → 95/10/20 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

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

## これを引用

*Algorithmic Learning Theory - 6th International Workshop, ALT 1995, Proceedings*(巻 997, pp. 41-54). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 997). Springer Verlag.