Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification of the algorithm...
Natural algorithms to compute rational expressions for recognizable
languages, even those which work well in practice, may produce very long
expressions. So, aiming towards the computation of the commutative image of a
recognizable language, one should avoid passing through an expression
produced this way.
We modify here one of those algorithms in
order to compute directly a semilinear expression for the commutative image
of a recognizable language. We also give a second
modification of the algorithm...
Let be a Banach operator ideal. Based on the notion of -compactness in a Banach space due to Carl and Stephani, we deal with the notion of measure of non–compactness of an operator. We consider a map (respectively, ) acting on the operators of the surjective (respectively, injective) hull of such that (respectively, ) if and only if the operator T is -compact (respectively, injectively -compact). Under certain conditions on the ideal , we prove an equivalence inequality involving and ....
Given an operator ideal , we say that a Banach space X has the approximation property with respect to if T belongs to for every Banach space Y and every T ∈ (Y,X), being the topology of uniform convergence on compact sets. We present several characterizations of this type of approximation property. It is shown that some of the existing approximation properties in the literature may be included in this setting.
Download Results (CSV)