The aim of this paper is to investigate the Hyers-Ulam stability of the  linear differential equation$$y''(x)+alpha y'(x)+beta y(x)=f(x)$$in general case, where $yin C^2[a,b],$  $fin C[a,b]$ and $-infty

Compositionality is undoubtedly one of the hardest problems in linguistics. In decoding theories, speaker occupies a leading role, having to carefully choose form that better encodes meaning be communicated. contrast, inferential burden shifted from hearer: linguistic information typically underspecifies and hearer must make number inferences bridge gap between what said meant. this article, I ...

Machine recognition of different patterns is termed pattern recognition. The assignation of patterns in sensory signals to knowledge is also known as classification. Organisms constantly classify their sensory perceptions to highlight this. Mathematical pattern recognition can be demonstrated with the following situation: There are one of the coincidentally determined patterns, from a finite bu...

In the paper we establish the general solution of the function equation f(2x+y)+f(2x-y) = f(x+y)+f(x-y)+2f(2x)-2f(x) and investigate the Hyers-Ulam-Rassias stability of this equation in 2-Banach spaces.

background: some evidences showed that the secretion of uterine tube vagina and follicular fluid (ff) affects x and y-chromosome populations. sperm selection with x or y chromosome can added to oocyte for gender desired. the isolation of x y sperm have done and all efforts in this field are done to make culture media similar to in vivo condition. the objective of this study was to find if the f...

The composition of two pattern restricted classes X,Y is the set of all permutation products θφ where θ ∈ X,φ ∈ Y . This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in terms of machines that sort and generate permutations. The theory is then applied to a multistage sorting...

An absent (or forbidden) word of a word y is a word that does not occur in y. It is then called minimal if all its proper factors occur in y. There exist linear-time and linear-space algorithms for computing all minimal absent words of y (Crochemore et al., 1998, Belazzougui et al., 2013, Barton et al., 2014). Minimal absent words are used for data compression (Crochemore et al., 2000, Ota and ...