Learning regular tree languages with positive samples and queries
Identifieur interne : 008879 ( Main/Merge ); précédent : 008878; suivant : 008880Learning regular tree languages with positive samples and queries
Auteurs : Jérôme Besombes ; Jean-Yves MarionSource :
English descriptors
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003365
- to stream Crin, to step Curation: 003365
- to stream Crin, to step Checkpoint: 001111
Links to Exploration step
CRIN:besombes02aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="37">Learning regular tree languages with positive samples and queries</title></titleStmt><publicationStmt><idno type="RBID">CRIN:besombes02a</idno><date when="2002" year="2002">2002</date><idno type="wicri:Area/Crin/Corpus">003365</idno><idno type="wicri:Area/Crin/Curation">003365</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003365</idno><idno type="wicri:Area/Crin/Checkpoint">001111</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001111</idno><idno type="wicri:Area/Main/Merge">008879</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Learning regular tree languages with positive samples and queries</title><author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name></author><author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>grammatical inference</term><term>learner/teacher paradigm</term><term>positifs samples</term><term>regular tree language</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="809">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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008879 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 008879 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:besombes02a
|texte= Learning regular tree languages with positive samples and queries
}}
| This area was generated with Dilib version V0.6.33. |  |