Learning regular tree languages with positive samples and queries

Jérôme Besombes 1 Jean-Yves Marion 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present an efficient learning algorithm IRTL for the class of regular tree languages. IRTL is based on the learner-theacher paradigm and works in quadratic time. The teacher give a characteristic sample of an unknown language L to the learner who tries to construct a minimal automata for L with help of queries. These queries are membership questions to the theacher. We give a proof of his correctness and terminaison and develop a full example.
Type de document :
Rapport
[Intern report] A02-R-201 || besombes02a, 2002, 10 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00101062
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:55:10
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00101062, version 1

Collections

Citation

Jérôme Besombes, Jean-Yves Marion. Learning regular tree languages with positive samples and queries. [Intern report] A02-R-201 || besombes02a, 2002, 10 p. 〈inria-00101062〉

Partager

Métriques

Consultations de la notice

68