Displaying 41 – 60 of 152

Showing per page

Learning discrete categorial grammars from structures

Jérôme Besombes, Jean-Yves Marion (2008)

RAIRO - Theoretical Informatics and Applications

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 to a word...

Lebesgue's Convergence Theorem of Complex-Valued Function

Keiko Narita, Noboru Endou, Yasunari Shidama (2009)

Formalized Mathematics

In this article, we formalized Lebesgue's Convergence theorem of complex-valued function. We proved Lebesgue's Convergence Theorem of realvalued function using the theorem of extensional real-valued function. Then applying the former theorem to real part and imaginary part of complex-valued functional sequences, we proved Lebesgue's Convergence Theorem of complex-valued function. We also defined partial sums of real-valued functional sequences and complex-valued functional sequences and showed their...

Currently displaying 41 – 60 of 152