We study the strict type assignment for λμ that is presented in [7]. We define a notion of approximants of λμ-terms, show that it generates a semantics, and that for each typeable term there is an approximant that has the same type. We show that this leads to a characterisation via assignable types for all terms that have a head normal form, and to one for all terms that have a normal form, as ...

We consider exact learning or identification of monotone Boolean functions by only using membership queries. It is shown that almost all monotone Boolean functions are polynomially identifiable in the input number of variables as well as the output being the sum of the sizes of the CNF and DNF representations.  2001 Elsevier Science B.V. All rights reserved.

We study the strict type assignment for λμ that is presented in [7]. We define a notion of approximants of λμ-terms, show that it generates a semantics, and that for each typeable term there is an approximant that has the same type. We show that this leads to a characterisation via assignable types for all terms that have a head normal form, and to one for all terms that have a normal form, as ...

In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...

We study the magnetic Laplacian in the case when the Neumann boundary contains an edge. We provide complete asymptotic expansions in powers of h of the low lying eigenpairs in the semiclassical limit h→ 0. In order to get our main result we establish a general method based on a normal form procedure, microlocal arguments, the Feshbach-Grushin reduction and the Born-Oppenheimer approximation.