AbstractWe describe algorithms that directly infer very simple forms of 1-unambiguous regular expressions from positive data. Thus, we characterize the regular language classes that can be learned this way, both in terms of regular expressions and in terms of (not necessarily minimal) deterministic finite automata
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
We present a new algorithm for ecient learning of regular languages from ex-amples and queries. A re...
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
AbstractWe describe algorithms that directly infer very simple forms of 1-unambiguous regular expres...
Learning from positive data constitutes an important topic in Grammatical Inference since it is beli...
. We present provably correct interactive algorithms for learning regular grammars from positive ex...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
AbstractIn this note, we consider the problem of learning approximately regular languages in the lim...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
A learning algorithm is developed for a class of regular expressions equivalent to the class of all ...
Children face an enormously difficult task in learning their na-tive language. It is widely believed...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
We present a new algorithm for ecient learning of regular languages from ex-amples and queries. A re...
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
AbstractWe describe algorithms that directly infer very simple forms of 1-unambiguous regular expres...
Learning from positive data constitutes an important topic in Grammatical Inference since it is beli...
. We present provably correct interactive algorithms for learning regular grammars from positive ex...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
This paper presents a novel method to infer regular expressions from positive examples. The method c...
AbstractIn this note, we consider the problem of learning approximately regular languages in the lim...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
A learning algorithm is developed for a class of regular expressions equivalent to the class of all ...
Children face an enormously difficult task in learning their na-tive language. It is widely believed...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
We present a new algorithm for ecient learning of regular languages from ex-amples and queries. A re...
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
DOI
Add to ORKG