Add to ORKGRapport interne.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
This paper introduces the notion of characteristic examples for languages and shows that the notion ...
In this thesis, an implementation of the MAT algorithm for query learning is improved and tested, sp...
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...
AbstractWe investigate regular tree languages’ exact learning from positive examples and membership ...
Colloque avec actes et comité de lecture. internationale.International audienceWe investigate regula...
We present a new algorithm for efficient learning of regular languages from examples and queries. A ...
We present a new algorithm for ecient learning of regular languages from ex-amples and queries. A re...
We study the problem of learning regular tree languages from text. We show that the framework of fu...
This paper presents an efficient algorithm for learning regular grammars. A knowledgeable teacher pr...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
AbstractWe show that simple deterministic languages are polynomial time learnable via membership que...
Abstract. In the fields of data mining and knowledge discovery, many semistructured data such as HTM...
A learning algorithm is developed for a class of regular expressions equivalent to the class of all ...
Abstract. We consider the polynomial time learnability of finite unions of ordered tree patterns wit...
Abstract. Angluin showed that the class of regular languages could be learned from a Minimally Adequ...
This paper introduces the notion of characteristic examples for languages and shows that the notion ...
In this thesis, an implementation of the MAT algorithm for query learning is improved and tested, sp...
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...
AbstractWe investigate regular tree languages’ exact learning from positive examples and membership ...
Colloque avec actes et comité de lecture. internationale.International audienceWe investigate regula...
We present a new algorithm for efficient learning of regular languages from examples and queries. A ...
We present a new algorithm for ecient learning of regular languages from ex-amples and queries. A re...
We study the problem of learning regular tree languages from text. We show that the framework of fu...
This paper presents an efficient algorithm for learning regular grammars. A knowledgeable teacher pr...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
AbstractWe show that simple deterministic languages are polynomial time learnable via membership que...
Abstract. In the fields of data mining and knowledge discovery, many semistructured data such as HTM...
A learning algorithm is developed for a class of regular expressions equivalent to the class of all ...
Abstract. We consider the polynomial time learnability of finite unions of ordered tree patterns wit...
Abstract. Angluin showed that the class of regular languages could be learned from a Minimally Adequ...
This paper introduces the notion of characteristic examples for languages and shows that the notion ...
In this thesis, an implementation of the MAT algorithm for query learning is improved and tested, sp...
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...