in arabic poetry, the device of repetition functions at two levels: form and meaning. in form, repetition makes for musical richness, and in meaning, it makes for emphasis. the present article is a study of repetition in “an address from the market of idleness” by palestinian poet samä«h al-qäsim. the poem depicts actual and possible palestinian sufferings inflicted by israelis and stresse...

abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...

In this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r . The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden wor...

A natural way to solve the problem of string matching with k mismatches, is to construct a nite automaton recognizing the language L P;k of all strings being at a distance k of the searched pattern P, and to use it for a linear search in the text. The problem of this approach is a high space complexity. In this paper, we show that, even if we consider the minimal DFA recognizing L P;k , the mem...

‎In this paper‎, ‎an approach based on statistical spline model (SSM) and collocation method is proposed to solve Volterra-Fredholm integral equations‎. ‎The set of collocation nodes is chosen so that the points yield minimal error in the nodal polynomials‎. ‎Under some standard assumptions‎, ‎we establish the convergence property of this approach‎. ‎Numerical results on some problems are given...

The standard way of solving the polynomial eigenvalue problem associated with a matrix polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem into an equivalent generalized eigenvalue problem. Such pencils are known as linearizations. Many of the families of linearizations for matrix polynomials available in the literature are extensions of the so-called fam...

‎we consider nonconvex vector optimization problems with variable ordering structures in banach spaces‎. ‎under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems‎. ‎using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...