نتایج جستجو برای: regular sequence
تعداد نتایج: 522946 فیلتر نتایج به سال:
a profile hidden markov model (phmm) is widely used in assigning protein sequences to protein families. in this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. in other words, in the phmm, only the information of the left side of a hidden state is considered. however, it makes sense that considering the information of the b...
Regular sequences generalize the extensively studied automatic sequences. Let S be an abstract numeration system. When language L is prefix-closed and regular, a sequence said to S-regular if module generated by its S-kernel finitely generated. In this paper, we give new characterization of such in terms underlying tree T(L) whose nodes are words L. We may decorate these interest following brea...
If a matrix .4 transforms a sequence {z„} into the sequence {z, A is said to be regular. The well known necessary and sufficient conditions for A to be regular are1 (a) X^-i |g»,*| Wo, (b) limn^oo an,k = 0 for every fixed fe, (c) XXi a»j»«A»—»1 as w-»°o. It is known2 that if a regular matrix s...
the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...
Protein sequence motifs describe, through means of enhanced regular expression syntax, regions of amino acids that have been conserved across several functionally related proteins. These regions may have an implication at the structural and functional level of the proteins. Sequence motif analysis can bring significant improvements towards a better understanding of the protein sequence-structur...
We show that the characteristic sequence of a regular language over the alphabet {a, b} is 2-automatic. keywords: finite automaton; regular language; automatic sequence MSC: 68Q45; 68Q70
in this paper some properties of weak regular injectivity for $s$-posets, where $s$ is a pomonoid, are studied. the behaviour of different kinds of weak regular injectivity with products, coproducts and direct sums is considered. also, some characterizations of pomonoids over which all $s$-posets are of some kind of weakly regular injective are obtained. further, we giv...
cohesion is an indispensable linguistic feature in discourse analysis. lexicald such a differe cohesion and conjunction in particular as two crucial elements to textual cohesion and comprehension has been the focus of a wide range of studies up to now. yet the relationship between the open register and cohesive devices has not been thoroughly investigated in discourse studies. this study concen...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید