263 search results - page 2 / 53 » Splitting of Learnable Classes |
LACL
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
TAMC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
ALT
2002
Springer
14 years 2 months ago
2002
Springer
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive ...
CONCUR
2012
Springer
11 years 8 months ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
LATA
2010
Springer
14 years 17 days ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...