A contribution to the top-to-bottom recognizer rehabilitation
Jiří Kopřiva (1968)
Kybernetika
Similarity:
Jiří Kopřiva (1968)
Kybernetika
Similarity:
František Mráz, Martin Plátek (1995)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Henning Fernau (2007)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability, as introduced by the author in [ (2003) 1679–1711], can be generalized from the case of string languages towards tree languages. This provides a large source of identifiable classes of regular tree languages. Each of these classes can be characterized in various ways. Moreover, we present a generic inference algorithm with polynomial update...
Julien Cervelle, Rémi Forax, Gilles Roussel (2007)
Computer Science and Information Systems
Similarity:
Jérôme Besombes, Jean-Yves Marion (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We define the class of discrete classical categorial grammars, similar in the spirit to the notion of reversible class of languages introduced by Angluin and Sakakibara. We show that the class of discrete classical categorial grammars is identifiable from positive structured examples. For this, we provide an original algorithm, which runs in quadratic time in the size of the examples. This work extends the previous results of Kanazawa. Indeed, in our work, several types can be associated...
Raoult, Jean-Claude (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Martin Plátek (1997)
Kybernetika
Similarity: