Add to ORKGAbstract. The problem of learning context-free languages is studied, in which a subclass called c-deterministic context-free languages is introduced. The class of c-deterministic context-free languages properly contains the class of regular sets. It is shown that the class of c-deterministic context-free languages is learnable in polynomial time from membership queries and equivalence queries, that is, it is polynomial time learnable from so-called minimally adequate teacher.
We study Turing machines that are allowed absolutely no space overhead. The only work space the mach...
AbstractWe consider the problem of learning a context-free grammar from its structural descriptions....
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...
Abstract. Angluin showed that the class of regular languages could be learned from a Minimally Adequ...
AbstractWe show that simple deterministic languages are polynomial time learnable via membership que...
Abstract. We present an algorithm for the inference of some Multi-ple Context-Free Grammars from Mem...
AbstractRecently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, ...
We survey methods for learning context-free languages (CFL's) in the theoretical computer science li...
AbstractWe study Turing machines that are allowed absolutely no space overhead. The only work space ...
We survey methods for learning context-free languages (CFL’s) in the theoretical computer science li...
We investigate models for learning the class of context-free and context-sensitive languages (CFLs a...
In this thesis, we investigate learnability of various subclasses of formal languages within the par...
AbstractThe growing context-sensitive languages are characterized by a non-deterministic machine mod...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
We study Turing machines that are allowed absolutely no space overhead. The only work space the mach...
AbstractWe consider the problem of learning a context-free grammar from its structural descriptions....
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...
Abstract. Angluin showed that the class of regular languages could be learned from a Minimally Adequ...
AbstractWe show that simple deterministic languages are polynomial time learnable via membership que...
Abstract. We present an algorithm for the inference of some Multi-ple Context-Free Grammars from Mem...
AbstractRecently Clark and Eyraud (2007) [10] have shown that substitutable context-free languages, ...
We survey methods for learning context-free languages (CFL's) in the theoretical computer science li...
AbstractWe study Turing machines that are allowed absolutely no space overhead. The only work space ...
We survey methods for learning context-free languages (CFL’s) in the theoretical computer science li...
We investigate models for learning the class of context-free and context-sensitive languages (CFLs a...
In this thesis, we investigate learnability of various subclasses of formal languages within the par...
AbstractThe growing context-sensitive languages are characterized by a non-deterministic machine mod...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
We study Turing machines that are allowed absolutely no space overhead. The only work space the mach...
AbstractWe consider the problem of learning a context-free grammar from its structural descriptions....
AbstractWe study the problem of learning an unknown language given a teacher which can only answer e...