Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:55:10 PM
Last modification on : Friday, February 4, 2022 - 3:21:45 AM


  • HAL Id : inria-00101062, version 1



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⟩



Record views